1 December 2009 in Investigative Ophthalmology & Visual Science
Purpose. A comparative study of the ability of some modal schemes to reproduce corneal shapes of varying complexity was performed, by using both standard radial polynomials and radial basis functions (RBFs). The hypothesis was that the correct approach in the case of highly irregular corneas should combine several bases. Methods. Standard approaches of reconstruction by Zernike and other types of radial polynomials were compared with the discrete least-squares fit (LSF) by the RBF in three theoretical surfaces, synthetically generated by computer algorithms in the absence of measurement noise. For the reconstruction by polynomials, the maximal radial order 6 was chosen, which corresponds to the first 28 Zernike polynomials or the first 49 Bhatia-Wolf polynomials. The fit with the RBF was performed by using a regular grid of centers. Results. The quality of fit was assessed by computing for each surface the mean square errors (MSEs) of the reconstruction by LSF, measured at the same nodes where the heights were collected. Another criterion of the fit quality used was the accuracy in recovery of the Zernike coefficients, especially in the case of incomplete data. Conclusions. The Zernike (and especially, the Bhatia-Wolf) polynomials constitute a reliable reconstruction method of a nonseverely aberrated surface with a small surface regularity index (SRI). However, they fail to capture small deformations of the anterior surface of a synthetic cornea. The most promising approach is a combined one that balances the robustness of the Zernike fit with the localization of the RBF.
1 January 2006 in SIAM Journal on Matrix Analysis and Applications
We consider bivariate real valued polynomials orthogonal with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between polynomials of different degrees. These formulas link the orthogonal polynomials constructed using the lexicographical ordering with those constructed using the reverse lexicographical ordering. Relations between the coefficients in the recurrence formulas are established and used to give necessary and sufficient conditions for the existence of a positive linear functional. Links to the theory of matrix orthogonal polynomials are developed as well the consequences of a zero assumption on one of the coefficients in the the recurrence formulas.
18 May 2010 in Numerical Algorithms
10 September 2016 in Symmetry, Integrability and Geometry: Methods and Applications
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained by adding to the moment functional a finite set of mass points, or by multiplying it times a polynomial of total degree 2, respectively. Orthogonal polynomials associated with modified moment functionals will be studied, as well as the impact of the modification in useful properties of the orthogonal polynomials. Finally, some illustrative examples will be given.
1 June 2005 in Journal of Computational and Applied Mathematics
1 August 2016 in Journal of Mathematical Analysis and Applications