scientific article; zbMATH DE number 3624709
From MaRDI portal
Publication:4187244
Cited in
(74)- Passing of instability points by applying a stabilized Newton-Raphson scheme to a finite element formulation: Comparison to arc-length method
- Enclosing methods in perturbed nonlinear operator equations
- Computing simple bifurcation points using a minimally extended system of nonlinear equations
- On solving nonlinear least-squares problems in case of rankdeficient Jacobians
- Solution of nonlinear systems of equations by an optimal projection method
- On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
- Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- A relation between Newton and Gauss-Newton steps for singular nonlinear equations
- On the R-order of coupled sequences arising in single-step type methods
- On dynamic decoupling and dynamic path controllability in economic systems
- A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
- An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations
- Combination of the sequential secant method and Broyden's method with projected updates
- On the R-order of coupled sequences
- Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
- An error analysis for the secant method
- Zum Potential der Materialfunktionen nichtlinear-viskoelastischer Stoffe
- Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
- Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten
- On the global and superlinear convergence of a discretized version of Wilson's method
- Secant methods for sparse systems of nonlinear equations with a special structure
- A globally convergent algorithm based on imbedding and parametric optimization
- On the R-order of coupled sequences. II
- On the R-order of coupled sequences. III
- An indirect method for computing origins for Hopf bifurcation in two- parameter problems
- Rigorous sensitivity analysis for parameter-dependent systems of equations
- Existence of zeros for bounded perturbations of proper mappings
- A modified block Newton iteration for approximating an invariant subspace of a symmetric matrix
- On decomposing systems of polynomial equations with finitely many solutions
- Convergence of Newton-like methods for singular operator equations using outer inverses
- Computation of a simple bifurcation point using one singular value decomposition nearby
- Computing multiple pitchfork bifurcation points
- The theory of Newton's method
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
- On an iterative algorithm of order 1.839 for solving the nonlinear least squares problems
- Parametrization via secant length and application to path following
- Computing hysteresis points of nonlinear equations depending on two parameters
- A predictor-corrector technique for constrained least-squares regularization
- An algorithm for solving sparse nonlinear least squares problems
- New dual-type decomposition algorithm for non-convex separable optimization problems
- Inexact Newton methods on a vector supercomputer
- An extension of the theory of secant preconditioners
- Curve fitting and identification of physical spectra
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- A survey on the high convergence orders and computational convergence orders of sequences
- Block Newton method and block Rayleigh quotient iteration for computing invariant subspaces of general complex matrices
- Sparsity in higher order methods for unconstrained optimization
- On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)
- Optimalr-order of an adjoint Broyden method without the assumption of linearly independent steps
- A hybrid method fur linearly constrained optimisation problems
- Iterative solution of systems of nonlinear equations based upon quadratic approximations
- A class of superlinear decomposition beetiiods in nonlinear equations
- Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
- Recent results in growth analysis
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
- The column-updating method for solving nonlinear equations in Hilbert space
- Nonlinear Rayleigh functionals
- On the stable global convergence of particular quasi-newton-methods
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- How many steps still left to x?
- Efficient estimation of sparse Jacobian matrices by differences
- A globalization scheme for the generalized Gauss-Newton method
- Gauss-Newton method for solving linear inverse problems with neural network coders
- Local convergence of a secant type method for solving least squares problems
- A projected-gradient interior-point algorithm for complementarity problems
- Broyden method for inverse non-symmetric Sturm-Liouville problems
- Globally convergent decomposition methods for nonconvex optimization problems
- Newton-like methods for the computation of fixed points
- A quasi-Newton method with modification of one column per iteration
- Consistent approximations in Newton-type decomposition methods
- On the local convergence of adjoint Broyden methods
- On Brown's method with convexity hypotheses.
- A continuation procedure based on projected Newton steps
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187244)
