Optimal sampling patterns for Zernike polynomials
A pattern of interpolation nodes on the disk is studied, for which the inter- polation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike polynomials is used. It is shown that these nodes have an excel...
Main Author: | Ramos López, Darío |
---|---|
Format: | info:eu-repo/semantics/article |
Language: | English |
Published: |
2018
|
Online Access: | http://hdl.handle.net/10835/5616 http://dx.doi.org/10.1016/j.amc.2015.11.006 |
Similar Items
-
Mining Small Routine Clinical Data: A Population Pharmacokinetic Model and Optimal Sampling Times of Capecitabine and its Metabolites
by: Oyaga-Iriarte, E. (Esther), et al.
Published: (2021) -
Discrete entropies of orthogonal polynomials
by: Aptekarev, A. I., et al.
Published: (2012) -
Patterns of birthweights /
by: Rice Puffer, Ruth
Published: (1987) -
Shannon entropy of symmetric Pollaczek polynomials
by: Martínez-Finkelshtein, Andrei, et al.
Published: (2012) -
Sobolev orthogonal polynomials: balance and asymptotics
by: Alfaro, Manuel, et al.
Published: (2017)