On the numerical recovery of a holomorphic mapping from a finite set of approximate values
From MaRDI portal
Publication:1597705
The least squares approach for the recovery of a holomorphic mapping from given perturbed nodal values is considered. The mapping is assumed to be a priori bounded by a known quantity, so that the recovery problem is well posed. The present analysis shows that for nodes that are zeros of Jacobi polynomials a quasioptimal algorithm results with a fairly moderate number of nodes. The analysis also takes into account the effect of the numerical linear algebra involved. Some experiments are presented.
Recommendations
- On some problems of optimal recovery of analytic and harmonic functions from inaccurate data
- Optimal recovery of functions of class \(E_ p\), \(1\leq p\leq\infty\), in multiply connected domains
- On optimal recovery of a holomorphic function in the unit ball of \(\mathbb{C}^ n\)
- scientific article; zbMATH DE number 219933
- On some problems of optimal recovery of analytic and harmonic functions from inaccurate data
Cited in
(2)
This page was built for publication: On the numerical recovery of a holomorphic mapping from a finite set of approximate values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597705)