Results 11 to 20 of about 308,108 (251)
ACM Transactions on Mathematical Software, 2009 Recent advances in multilevel LU factorizations and novel preprocessing techniques have led to an extremely large number of possibilities for preconditioning sparse, unsymmetric linear systems for solving with iterative methods. However, not all combinations work well for all systems, so making the right choices is essential for obtaining an efficient ...
openaire +4 more sources
Iterative solution of shifted positive-definite linear systems arising in a numerical method for the heat equation based on Laplace transformation and quadrature [PDF]
ANZIAM Journal, 2011 AbstractIn earlier work we have studied a method for discretization in time of a parabolic problem, which consists of representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In application to a spatially semidiscrete finite-element version of the parabolic problem, at each quadrature ...
Mclean, William, Thomée, Vidar
openaire +2 more sources
XAMG: A library for solving linear systems with multiple right-hand side vectors
SoftwareX, 2021 This paper presents the XAMG library for solving large sparse systems of linear algebraic equations with multiple right-hand side vectors. The library specializes, but is not limited, to the solution of linear systems obtained from the discretization of ...
Boris Krasnopolsky, Alexey Medvedev
doaj +1 more source
Alexandria Engineering Journal, 2021 This paper contributes to develop a highly accurate numerical method for solving two-dimensional mass transfer equations during convective air drying of apple slices.
Yin Yang +4 more
doaj +1 more source
Quantization in Control Systems and Forward Error Analysis of Iterative Numerical Algorithms [PDF]
, 2010 The use of control theory to study iterative algorithms, which can be considered as dynamical systems, opens many opportunities to find new tools for analysis of algorithms.
Constantinides, GA +2 more
core +2 more sources
Preconditioned fully implicit PDE solvers for monument conservation [PDF]
, 2010 Mathematical models for the description, in a quantitative way, of the damages induced on the monuments by the action of specific pollutants are often systems of nonlinear, possibly degenerate, parabolic equations. Although some the asymptotic properties
Berger A. E. +3 more
core +2 more sources
A comparison of numerical splitting-based methods for Markovian dependability and performability models [PDF]
, 1998 Iterative numerical methods are an important ingredient for the solution of continuous time Markov dependability models of fault-tolerant systems. In this paper we make a numerical comparison of several splitting-based iterative methods. We consider the
Carrasco, Juan A., Suñé, Víctor
core +1 more source
A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
Open Mathematics, 2016 It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices).
Zhang Cheng-yi +2 more
doaj +1 more source
Preconditioning and convergence in the right norm [PDF]
, 2007 The convergence of numerical approximations to the solutions of differential equations is a key aspect of Numerical Analysis and Scientific Computing.
Wathen, A. J.
core +1 more source
Two Iterative Methods for Solving Linear Interval Systems
Applied Computational Intelligence and Soft Computing, 2018 Conjugate gradient is an iterative method that solves a linear system Ax=b, where A is a positive definite matrix. We present this new iterative method for solving linear interval systems Ãx̃=b̃, where à is a diagonally dominant interval matrix, as ...
Esmaeil Siahlooei +1 more
doaj +1 more source