scientific article; zbMATH DE number 3976197
From MaRDI portal
Publication:3740904
Recommendations
Cited in
(only showing first 100 items - show all)- Coreduction homology algorithm
- Numerical study on incomplete orthogonal factorization preconditioners
- A nine-point finite volume scheme for the simulation of diffusion in heterogeneous media
- A comparison of projective and direct solvers for finite elements in elastostatics
- Modified incomplete orthogonal factorization methods using Givens rotations
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Selection of fictitious independent variables for the solution of sparse linear equations
- On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
- Implementing linear algebra algorithms on a Meiko Computing Surface
- A static-regridding method for two-dimensional parabolic partial differential equations
- A numerical scheme for the solution of the space charge problem on a multiply connected region
- A finite-difference scheme overconvergent at certain mesh points
- A block algorithm for computing rank-revealing QR factorizations
- A hierarchical algorithm for making sparse matrices sparser
- A parallel projection method for overdetermined nonlinear systems of equations
- Algebraic languages for mathematical programming
- The effect of ordering on preconditioned conjugate gradients
- Detecting embedded pure network structures in LP problems
- LU factorization of non-standard forms and direct multiresolution solvers
- Cost-effective sulphur emission reduction under uncertainty
- Efficient iterative solution of the three-dimensional Helmholtz equation
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems
- A new matrix bandwidth reduction algorithm
- Ordering algorithms for irreducible sparse linear systems
- A fast LU update for linear programming
- A parallel interior point algorithm for linear programming on a network of transputers
- An optimum partition for inverting a nonsingular matrix
- Some new results regarding spikes and a heuristic for spike construction
- MOPS -- Mathematical optimization system
- Analysis and implementation of a dual algorithm for constrained optimization
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Linear algebraic transformations of the bidomain equations: Implications for numerical methods
- Parallel algorithms for solving large linear systems
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
- Hybrid algorithms with automatic switching for solving nonlinear equation systems
- A highly flexible tool for large scale computational problems in applied physics
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- The preconditioned conjugate gradient method with incomplete factorization preconditioners
- Stability of the Gauss-Huard algorithm with partial pivoting
- Efficient sensitivity analysis of large-scale differential-algebraic systems
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- Two improved algorithms for envelope and wavefront reduction
- Partitioning mathematical programs for parallel solution
- Sparse direct methods for model simulation
- Explicit approximate inverse preconditioning techniques
- On efficient preconditioners for iterative solution of a Galerkin boundary element equation for the three-dimensional exterior Helmholtz problem
- Unravelling small world networks
- Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems.
- Symbiosis between linear algebra and optimization
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Advances in design and implementation of optimization software
- An iterative substructuring method for coupled fluid-solid acoustic problems
- A unified formulation for mechanical joints with and without clearances/bushings and/or stops in the framework of multibody systems
- Development and validation of a chemical reaction solver coupled to the FLASH code for combustion applications
- Preconditioning complex symmetric linear systems
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Predispatch of hydroelectric power systems with modifications in network topologies
- Graph transformations for efficient structural analysis
- An explicit formula for the inverse of arrowhead and doubly arrow matrices
- An efficient direct method for fully conforming spectral collocation schemes
- An implementation of Karmarkar's algorithm for linear programming
- Multiprocessing a sparse matrix code on the Alliant FX/8
- Preconditioning techniques for large linear systems: A survey
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- A geometric framework for sparse matrix problems
- Parallel homotopy algorithm for symmetric large sparse eigenproblems
- An extension of the theory of secant preconditioners
- A general iterative sparse linear solver and its parallelization for interval Newton methods
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Experiences with sparse matrix solvers in parallel ODE software
- Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations
- Modular analysis of sequential solution methods for almost block diagonal systems of equations
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Stability and inertia
- Solving systems of elastic bar structures by preconditioned conjugate gradient method
- Incomplete factorization by local exact factorization (ILUE)
- A manifold-based approach to sparse global constraint satisfaction problems
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
- Computing the smallest singular triplets of a large matrix
- Solving piecewise linear systems in ABS-normal form
- A frictional contact algorithm for implicit material point method
- Radial basis function methods for optimal control of the convection-diffusion equation: a numerical study
- An efficient method for computing the inverse of arrowhead matrices
- A sparsity for decomposing a symmetric matrix
- Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix
- Twisted factorization of a banded matrix
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Additive preconditioning and aggregation in matrix computations
- On the tree-depth of random graphs
- An isochoric domain deformation method for computing steady free surface flows with conserved volumes
- Optimization of a complex flexible multibody systems with composite materials
- Composite materials in flexible multibody systems
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- A parallel implementation of Wang's method for solving tridiagonal systems
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- A new approach to compute sparse approximate inverse factors of a matrix
- A clustering method based on multidimensional texture analysis
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)
