Algorithms defined by Nash iteration: Some implementations via multilevel collocation and smoothing
From MaRDI portal
Publication:1576455
Nash iterations for the numerical solution of differential equations are described. A particular choice with multilevel collocation and smoothing is investigated. An adaption involving a splitting of the inversion and the smoothing into two separate steps is employed. The approximate solvers are applied to the solution of evolution equations with calibrated time steps.
Recommendations
- Newton iteration with multiquadrics for the solution of nonlinear PDEs
- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- scientific article; zbMATH DE number 617847
- An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
Cites work
- A NEW TECHNIQUE FOR THE CONSTRUCTION OF SOLUTIONS OF NONLINEAR DIFFERENTIAL EQUATIONS
- An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
- An asymptotically linear fixed point extension of the inf-sup theory of galerkin approximation
- Approximate solution of systems of linear equations†
- Approximation of nonlinear evolution systems
- Convergence order estimates of meshless collocation methods using radial basis functions
- scientific article; zbMATH DE number 3423512 (Why is no real title available?)
- scientific article; zbMATH DE number 3938445 (Why is no real title available?)
- scientific article; zbMATH DE number 1284009 (Why is no real title available?)
- scientific article; zbMATH DE number 1284039 (Why is no real title available?)
- scientific article; zbMATH DE number 1404597 (Why is no real title available?)
- scientific article; zbMATH DE number 3232484 (Why is no real title available?)
- scientific article; zbMATH DE number 3416066 (Why is no real title available?)
- Jackson and Bernstein-type inequalities for families of commutative operators in Banach spaces
- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- Multistep scattered data interpolation using compactly supported radial basis functions
- On approximate approximations using Gaussian kernels
- On Nash's implicit functional theorem
- Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
- Solving differential equations with radial basis functions: Multilevel methods and smoothing
- The boundary problems of physical geodesy
- The imbedding problem for Riemannian manifolds
Cited in
(6)- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- Newton iteration with multiquadrics for the solution of nonlinear PDEs
- A meshfree method for the solution of two-dimensional cubic nonlinear Schrödinger equation
- Microbreaking and polycnoidal waves in the Ostrovsky-Hunter equation
- Trust-region methods for nonlinear elliptic equations with radial basis functions
- Iterative schemes for probabilistic domain decomposition
This page was built for publication: Algorithms defined by Nash iteration: Some implementations via multilevel collocation and smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1576455)