Results 51 to 60 of about 217 (109)
Convergence Proof of Jacobi Iterative Method for A Discretized 2D Convection-Diffusion Equation
, 1998 We prove that the Jacobi iterative method converges from any initial values for solving the linear system resulting from a fourth-order compact finite difference discretization of the 2D convection-diffusion equation with constant convection coefficients.
Shiqing Zhang, Deyu Sang
core
Partitioning Rectangular And Structurally Nonsymmetric Sparse Matrices For Parallel Processing
, 1998 . A common operation in scientific computing is the multiplication of a sparse, rectangular or structurally nonsymmetric matrix and a vector. In many applications the matrix-transposevector product is also required.
Tamara +2 more
core
Transpose-Free Formulations Of Lanczos-Type Methods For Nonsymmetric Linear Systems
, 2007 . We present a transpose-free version of the nonsymmetric scaled Lanczos procedure. It generates the same tridiagonal matrix as the classical algorithm, using two matrix-vector products per iteration without accessing A T .
Tony F. Chan +3 more
core
Wavelet estimate of time series
, 2001 In this paper a wavelet technique to study time series by discrete wavelet coefficients, is proposed. Since time series are mainly represented by histograms we will use the Haar waveletes and the Haar wavelet interpolation [1,2].
CATTANI, Carlo +2 more
core
On certain properties of linear iterative equations
Open Mathematics, 2014 Ndogmo Jean-Claude, Mahomed Fazal
doaj +1 more source
A Restricted Additive Schwarz Preconditioner For General Sparse Linear Systems
, 1997 . We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superior to AS in terms of both iteration counts and CPU ...
Xiao-chuan Cai, Marcus Sarkis
core
An eigenvalue localization set for tensors and its applications. [PDF]
J Inequal Appl, 2017 Zhao J, Sang C.
europepmc +1 more source
Wavelet Sparse Approximate Inverse Preconditioners
, 1997 . We show how to use wavelet compression ideas to improve the performance of approximate inverse preconditioners. Our main idea is to first transform the inverse of the coefficient matrix into a wavelet basis, before applying standard approximate ...
W.P. Tang, Tony F. Chan, W. L. Wan
core
Low rank Tucker-type tensor approximation to classical potentials
Open Mathematics, 2007 Khoromskij B., Khoromskaia V.
doaj +1 more source
An upper bound for the Z-spectral radius of adjacency tensors. [PDF]
J Inequal Appl, 2018 Wu ZY, He J, Liu YM, Tian JK.
europepmc +1 more source