Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 3

fixed-point Related Publications

3 On the Existence and Global Attractivity of Solutions of a Functional Integral Equation

Authors: Asadollah Aghajani, Yaghoub Jalilian

Abstract:

Using the concept of measure of noncompactness, we present some results concerning the existence, uniform local attractivity and global attractivity of solutions for a functional integral equation. Our results improve and extend some previous known results and based on weaker conditions. Some examples which show that our results are applicable when the previous results are inapplicable are also included.

Keywords: fixed-point, asymptotic stability, Functional integral equation, measure of noncompactness, attractive solution

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 932
2 A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion

Authors: Aki Happonen, Adrian Burian, Erwin Hemming

Abstract:

Fixed-point simulation results are used for the performance measure of inverting matrices by Cholesky decomposition. The fixed-point Cholesky decomposition algorithm is implemented using a fixed-point reconfigurable processing element. The reconfigurable processing element provides all mathematical operations required by Cholesky decomposition. The fixed-point word length analysis is based on simulations using different condition numbers and different matrix sizes. Simulation results show that 16 bits word length gives sufficient performance for small matrices with low condition number. Larger matrices and higher condition numbers require more dynamic range for a fixedpoint implementation.

Keywords: fixed-point, Cholesky Decomposition, Matrix inversion, Reconfigurable processing

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1282
1 A Reconfigurable Processing Element Implementation for Matrix Inversion Using Cholesky Decomposition

Authors: Aki Happonen, Adrian Burian, Erwin Hemming

Abstract:

Fixed-point simulation results are used for the performance measure of inverting matrices using a reconfigurable processing element. Matrices are inverted using the Cholesky decomposition algorithm. The reconfigurable processing element is capable of all required mathematical operations. The fixed-point word length analysis is based on simulations of different condition numbers and different matrix sizes.

Keywords: fixed-point, Cholesky Decomposition, Reconfigurable processing, Matrixinversion

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1308