scientific article; zbMATH DE number 3976197
From MaRDI portal
Publication:3740904
Recommendations
Cited in
(only showing first 100 items - show all)- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Qualitative decomposition of the eigenvalue problem in a dynamic system
- A class of iterative solvers for the Helmholtz equation: factorizations, sweeping preconditioners, source transfer, single layer potentials, polarized traces, and optimized Schwarz methods
- Mathematical models in process engineering
- Experiences with sparse matrix solvers in parallel ODE software
- Algebraic languages for mathematical programming
- Reversing the row order for the row-by-row frontal method
- Preconditioning techniques for large linear systems: A survey
- Diagonal scaling of ill-conditioned matrixes by genetic algorithm
- On sparse matrix orderings in interior point methods
- scientific article; zbMATH DE number 7049775 (Why is no real title available?)
- Parallelization of Advection-Diffusion-Chemistry Modules
- scientific article; zbMATH DE number 1441684 (Why is no real title available?)
- Direct methods for sparse matrices
- Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems
- Additive preconditioning and aggregation in matrix computations
- A survey of direct methods for sparse linear systems
- A clustering method based on multidimensional texture analysis
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Newton's method for solving heat transfer, fluid flow and interface shapes in a floating molten zone
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Localization in matrix computations: theory and applications
- Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III
- Globally Convergent Algorithm for Solving Large Nonlinear Systems of Equations
- An object‐oriented interface for the dynamic memory management of sparse discrete mathematical operators in numerical scientific applications
- Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- Incomplete factorization by local exact factorization (ILUE)
- Road vehicle modeling requirements for optimization of ride and handling
- Detecting embedded pure network structures in LP problems
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- On the ordering of sparse linear systems
- Unravelling small world networks
- An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
- Efficient sensitivity analysis of large-scale differential-algebraic systems
- A Dimensional Reduction Algorithm and Software for Acyclically Dependent Constraints
- Two improved algorithms for envelope and wavefront reduction
- Solving linear systems in interior-point methods
- A fast LU update for linear programming
- Cost-effective sulphur emission reduction under uncertainty
- scientific article; zbMATH DE number 51442 (Why is no real title available?)
- scientific article; zbMATH DE number 1442000 (Why is no real title available?)
- On the complexity of the block low-rank multifrontal factorization
- Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems.
- Graph transformations for efficient structural analysis
- Parallel algorithms for solving large linear systems
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Symbiosis between linear algebra and optimization
- A new approach to compute sparse approximate inverse factors of a matrix
- Stability of the Gauss-Huard algorithm with partial pivoting
- Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices
- Ordering algorithms for irreducible sparse linear systems
- A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems
- Finite-element method for elastic wave propagation
- Preconditioned conjugate gradient methods for three‐dimensional linear elasticity
- A highly flexible tool for large scale computational problems in applied physics
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Efficient robust optimization for robust control with constraints
- Analysis of the solution phase of a parallel multifrontal approach
- A sparse matrix approach to Bayesian computation in large linear models
- Numerical study on incomplete orthogonal factorization preconditioners
- Parallel preconditioned conjugate gradient algorithm on GPU
- Modified incomplete orthogonal factorization methods using Givens rotations
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- A new matrix bandwidth reduction algorithm
- Direct Methods for Sparse Linear Systems
- Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement
- Symbolic elimination in dynamic optimization based on block-triangular ordering
- Matrix-free convex optimization modeling
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Computing the smallest singular triplets of a large matrix
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- The effect of ordering on preconditioned conjugate gradients
- scientific article; zbMATH DE number 4147877 (Why is no real title available?)
- An implementation of Karmarkar's algorithm for linear programming
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- Parallel homotopy algorithm for symmetric large sparse eigenproblems
- A general iterative sparse linear solver and its parallelization for interval Newton methods
- An efficient preconditioned iterative solver for solving a coupled fluid structure interaction problem
- Development and validation of a chemical reaction solver coupled to the FLASH code for combustion applications
- The column-updating method for solving nonlinear equations in Hilbert space
- Control of large-scale systems in a multiprocessor environment
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Matrix-free interior point method
- A block algorithm for computing rank-revealing QR factorizations
- Algebraic stabilization of explicit numerical integration for extremely stiff reaction networks
- A geometric framework for sparse matrix problems
- On the row merge tree for sparse LU factorization with partial pivoting
- Event and apparent horizon finders for 3+1 numerical relativity
- An extension of the theory of secant preconditioners
- Frequent directions: simple and deterministic matrix sketching
- A two-level ILU preconditioner for electromagnetic applications
- On a network method for unsteady incompressible fluid flow on triangular grids
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- A frictional contact algorithm for implicit material point method
- Interior point methods for power flow optimization with security constraints
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 Q3740904)
