Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems
From MaRDI portal
Publication:4700279
DOI10.1080/10556789908805741zbMath0984.65046OpenAlexW1981520190MaRDI QIDQ4700279
Publication date: 7 February 2002
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805741
global convergenceparallel computationinner and outer iterationsblock bordered systemslarge and sparse nonlinear systemsmultistage Newton-like methods
Numerical computation of solutions to systems of equations (65H10) Parallel numerical computation (65Y05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A view of the limitations, opportunities, and challenges in parallel nonlinear optimization
- Consistent approximations in Newton-type decomposition methods
- Parallel quasi-Newton methods for unconstrained optimization
- A parallel algorithm for solving block tridiagonal linear systems
- Nonmonotone stabilization methods for nonlinear equations
- Convergence and numerical results for a parallel asynchronous quasi- Newton method
- A class on nonmonotone stabilization methods in unconstrained optimization
- Some large-scale matrix computation problems
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Block Preconditioning for the Conjugate Gradient Method
- Parallel Algorithms for Nonlinear Problems
- Solution of Partial Differential Equations on Vector and Parallel Computers
- A multilevel Newton algorithm with macromodeling and latency for the analysis of large-scale nonlinear circuits in the time domain
- Inexact Newton Methods
- Global inexact Newton methods for very large scale nonlinear problems
- Parallel Methods for Solving Nonlinear Block Bordered Systems of Equations
- A latent macromodular approach to large-scale sparse networks
- On Permutations to Block Triangular Form
- Quasi-Newton Methods, Motivation and Theory
- Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- Parallel Gradient Distribution in Unconstrained Optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Depth-First Search and Linear Graph Algorithms
- Solving Systems of Nonlinear Equations on a Message-Passing Multiprocessor
