Results 1  10
of
80
Methods for the analysis of the Lindstedt series for KAM tori and renormalizability in classical mechanics  A review with some applications
, 1995
"... ..."
Solving Differential Equations with Radial Basis Functions: Multilevel Methods and Smoothing
 Advances in Comp. Math
"... . Some of the meshless radial basis function methods used for the numerical solution of partial differential equations are reviewed. In particular, the differences between globally and locally supported methods are discussed, and for locally supported methods the important role of smoothing within a ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
. Some of the meshless radial basis function methods used for the numerical solution of partial differential equations are reviewed. In particular, the differences between globally and locally supported methods are discussed, and for locally supported methods the important role of smoothing within a multilevel framework is demonstrated. A possible connection between multigrid finite elements and multilevel radial basis function methods with smoothing is explored. Various numerical examples are also provided throughout the paper. 1. Introduction During the past few years the idea of using socalled meshless methods for the numerical solution of partial differential equations (PDEs) has received much attention throughout the scientific community. As a few representative examples we mention Belytschko and coworker's results [3] using the socalled elementfree Galerkin method, Duarte and Oden's work [11] using hp clouds, Babuska and Melenk 's work [1] on the partition of unity method, ...
Multistep Approximation Algorithms: Improved Convergence Rates through Postconditioning with Smoothing Kernels
 Advances in Comp. Math. 10
, 1999
"... . We show how certain widely used multistep approximation algorithms can be interpreted as instances of an approximate Newton method. It was shown in an earlier paper by the second author that the convergence rates of approximate Newton methods (in the context of the numerical solution of PDEs) suff ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
. We show how certain widely used multistep approximation algorithms can be interpreted as instances of an approximate Newton method. It was shown in an earlier paper by the second author that the convergence rates of approximate Newton methods (in the context of the numerical solution of PDEs) suffer from a "loss of derivatives", and that the subsequent linear rate of convergence can be improved to be superlinear using an adaptation of NashMoser iteration for numerical analysis purposes; the essence of the adaptation being a splitting of the inversion and the smoothing into two separate steps. We show how these ideas apply to scattered data approximation as well as the numerical solution of partial differential equations. We investigate the use of several radial kernels for the smoothing operation. In our numerical examples we use radial basis functions also in the inversion step. 1. Introduction It has been only very recently that the idea of multistep (or multilevel) interpolation ...
The KolmogorovArnoldMoser theorem
 Math. Phys. Electron. J
, 2004
"... This paper gives a self contained proof of the perturbation theorem for invariant tori in Hamiltonian systems by Kolmogorov, Arnold, and Moser with sharp differentiablility hypotheses. The proof follows an idea outlined by Moser in [16] and, as byproducts, gives rise to uniqueness and regularity the ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper gives a self contained proof of the perturbation theorem for invariant tori in Hamiltonian systems by Kolmogorov, Arnold, and Moser with sharp differentiablility hypotheses. The proof follows an idea outlined by Moser in [16] and, as byproducts, gives rise to uniqueness and regularity theorems for invariant tori. 1 1
A nonlinear analysis of the averaged Euler equations
 Fields Inst. Comm., Arnold
, 1998
"... This paper develops the geometry and analysis of the averaged Euler equations for ideal incompressible flow in domains in Euclidean space and on Riemannian manifolds, possibly with boundary. The averaged Euler equations involve a parameter α; one interpretation is that they are obtained by ensemble ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
This paper develops the geometry and analysis of the averaged Euler equations for ideal incompressible flow in domains in Euclidean space and on Riemannian manifolds, possibly with boundary. The averaged Euler equations involve a parameter α; one interpretation is that they are obtained by ensemble averaging the Euler equations in Lagrangian representation over rapid fluctuations whose amplitudes are of order α. The particle flows associated with these equations are shown to be geodesics on a suitable group of volume preserving diffeomorphisms, just as with the Euler equations themselves (according to Arnold’s theorem), but with respect to a right invariant H 1 metric instead of the L 2 metric. The equations are also equivalent to those for a certain second grade fluid. Additional properties of the Euler equations, such as smoothness of the geodesic spray (the EbinMarsden theorem) are also shown to hold. Using this nonlinear analysis framework, the limit of zero viscosity for the corresponding viscous equations is shown to be a regular limit, even in the
Algorithms Defined by Nash Iteration: Some Implementations via Multilevel Collocation and Smoothing
"... ..."
Quasiperiodic solutions with Sobolev regularity of NLS on T d with a multiplicative potential
 J. European Math. Society
, 2013
"... Abstract: We prove the existence of quasiperiodic solutions for Schrödinger equations with a multiplicative potential on T d, d ≥ 1, merely differentiable nonlinearities, and tangential frequencies constrained along a preassigned direction. The solutions have only Sobolev regularity both in time a ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract: We prove the existence of quasiperiodic solutions for Schrödinger equations with a multiplicative potential on T d, d ≥ 1, merely differentiable nonlinearities, and tangential frequencies constrained along a preassigned direction. The solutions have only Sobolev regularity both in time and space. If the nonlinearity and the potential are C ∞ then the solutions are C ∞. The proofs are based on an improved NashMoser iterative scheme, which assumes the weakest tame estimates for the inverse linearized operators (“Green functions”) along scales of Sobolev spaces. The key offdiagonal decay estimates of the Green functions are proved via a new multiscale inductive analysis. The main novelty concerns the measure and “complexity ” estimates.
Construction of invariant whiskered tori by a parameterization method. part I: Maps . . .
, 2009
"... We present theorems which provide the existence of invariant whiskered tori in finitedimensional exact symplectic maps and flows. The method is based on the study of a functional equation expressing that there is an invariant torus. We show that, given an approximate solution of the invariance eq ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present theorems which provide the existence of invariant whiskered tori in finitedimensional exact symplectic maps and flows. The method is based on the study of a functional equation expressing that there is an invariant torus. We show that, given an approximate solution of the invariance equation which satisfies some nondegeneracy conditions, there is a true solution nearby. We call this an a posteriori approach. The proof of the main theorems is based on an iterative method to solve the functional equation. The theorems do not assume that the system is close to integrable nor that it is written in actionangle variables (hence we can deal in a unified way with primary and secondary tori). It also does not assume that the hyperbolic bundles are trivial and much less that the hyperbolic motion can be reduced to constant. The a posteriori formulation allows us to justify approximate solutions produced by many nonrigorous methods (e.g. formal series expansions, numerical methods). The iterative method is not based on transformation theory, but rather on succesive corrections. This makes it possible to adapt the method almost verbatim to several infinitedimensional situations, which we will discuss in a forthcoming paper. We also note that the method leads to fast and efficient algorithms. We plan to develop these improvements in forthcoming papers.
An estimate of smoothing and composition with applications to conjugation problems
 GS79] [Jac72] [Kra83
, 1979
"... problems ..."