On the optimal choice of nodes in the collocation-projection method for solving linear operator equations
Publication:1227264
DOI10.1016/0021-9045(76)90046-0zbMath0329.65040OpenAlexW2054256676MaRDI QIDQ1227264
Publication date: 1976
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(76)90046-0
General theory of numerical analysis in abstract spaces (65J05) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Linear boundary value problems for ordinary differential equations (34B05)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regression design for some equivalence classes of kernels
- Piecewise polynomial approximation on optimal meshes
- Regression designs in autoregressive stochastic processes
- Some results on Tchebycheffian spline functions and stochastic processes
- Convergence rates of certain approximate solutions to Fredholm integral equations of the first kind
- A class of approximate solutions to linear operator equations
- Splines (with optimal knots) are better
- Designs for Regression Problems with Correlated Errors
- Designs for Regression Problems With Correlated Errors: Many Parameters
- On the Regression Design Problem of Sacks and Ylvisaker
- On a class of best nonlinear approximation problems
- Collocation at Gaussian Points
- Designs for Regression Problems with Correlated Errors III
This page was built for publication: On the optimal choice of nodes in the collocation-projection method for solving linear operator equations