Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
On generalized Newton algorithms: quadratic convergence, path-following and error analysis
Selected papers of the workshop on Continuous algorithms and complexity
Complexity of Bezout's theorem V: polynomial time
Selected papers of the workshop on Continuous algorithms and complexity
Complexity of Bezout's theorem IV: probability of success; extensions
SIAM Journal on Numerical Analysis
Complexity and real computation
Complexity and real computation
The Geometry of Algorithms with Orthogonality Constraints
SIAM Journal on Matrix Analysis and Applications
Multihomogeneous Newton methods
Mathematics of Computation
Generalized Polar Decompositions for the Approximation of the Matrix Exponential
SIAM Journal on Matrix Analysis and Applications
Kantorovich's theorem on Newton's method in Riemannian Manifolds
Journal of Complexity
Descent methods for optimization on homogeneous manifolds
Mathematics and Computers in Simulation
Journal of Mathematical Imaging and Vision
Hi-index | 0.00 |
We use a Hamiltonian approach and symplectic methods to compute the geodesics on a Riemannian submanifold.