Parallel Algorithms for Nonlinear Problems
From MaRDI portal
Publication:3740926
DOI10.1137/0607017zbMath0604.65032OpenAlexW1975563825MaRDI QIDQ3740926
No author found.
Publication date: 1986
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0607017
comparisonsuccessive overrelaxationmultisplittingparallel Newton-SOR algorithmparallel nonlinear Gauss-Seidel algorithm
Related Items (37)
Asynchronous multisplitting nonlinear Gauss-Seidel type method ⋮ Models of parallel chaotic iteration methods ⋮ On the convergence of parallel chaotic nonlinear multisplitting Newton-type methods ⋮ Parallel multisplitting AOR method for solving a class of systems of nonlinear algebraic equations ⋮ A CLASS OF ASYNCHRONOUS PARALLEL NONLINEAR MULTISPLITTING RELAXATION METHODS ⋮ MULTISPLITTING RELAXED METHODS FOR A CLASS OF SYSTEM OF NONLINEAR EQUATIONS ⋮ PARALLEL MULTISPLITTINGS FOR OPTIMIZATION∗ ⋮ MODULAR FIXED-SIZE VLSI ARCHITECTURES FOR GENERAL MULTISPLITTING ITERATION ⋮ Parallel nonlinear multisplitting relaxation methods ⋮ Parallel nonlinear multisplitting methods ⋮ The monotone convergence rate of the parallel nonlinear AOR method ⋮ Parallel nonlinear AOR method and its convergence ⋮ Convergence of relaxed parallel multisplitting methods ⋮ A globally convergent parallel algorithm for zeros of polynomial systems ⋮ Improved comparison theorem for the nonlinear multisplitting relaxation method ⋮ The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems ⋮ Convergence analysis of the parallel multisplitting TOR method ⋮ Asynchronous multisplitting relaxed iterations for weakly nonlinear systems ⋮ Asynchronous multisplitting aor method for a system of nonlinear algebraic equations ⋮ Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems ⋮ Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems ⋮ Convergence analysis of the parallel multisplitting psd method ⋮ Parallel multisplitting explicit AOR methods for numerical solutions of semilinear elliptic boundary value problems ⋮ THE PARALLEL MULTISPLITTING GENERALIZED ITERATIVE METHODS ⋮ The multisplitting PSD (MPSD) method for systems of weakly nonlinear equations ⋮ On the convergence of block constrained nonlinear equation solvers∗ ⋮ Convergence of parallel multisplitting iterative methods for M-matrices ⋮ Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems ⋮ Safe bounds for the solutions of nonlinear problems using a parallel multisplitting method ⋮ New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems ⋮ Multisplittings and parallel iterative methods ⋮ Parallel multisplitting methods for a class of systems of weakly nonlinear equations without isotone mapping ⋮ The granularity of parallel homotopy algorithms for polynomial systems of equations ⋮ Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems ⋮ Asynchronous multisplitting AOR methods for a class of systems of weakly nonlinear equations ⋮ Asynchronous block-iterative methods for almost linear equations ⋮ On the convergence of the parallel multisplitting AOR algorithm
Cites Work
This page was built for publication: Parallel Algorithms for Nonlinear Problems