A posteriori error estimators for the Stokes equations II non-conforming discretizations.
A preconditioner for the FETI-DP method for mortar-type Crouzeix-Raviart element discretization
In this paper, we consider mortar-type Crouzeix-Raviart element discretizations for second order elliptic problems with discontinuous coefficients. A preconditioner for the FETI-DP method is proposed. We prove that the condition number of the preconditioned operator is bounded by , where and are mesh sizes. Finally, numerical tests are presented to verify the theoretical results.
A propos de l’algorithme
A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search
The Alternating Nonnegative Least Squares (ANLS) method is commonly used for solving nonnegative tensor factorization problems. In this paper, we focus on algorithmic improvement of this method. We present a Proximal ANLS (PANLS) algorithm to enforce convergence. To speed up the PANLS method, we propose to combine it with a periodic enhanced line search strategy. The resulting algorithm, PANLS/PELS, converges to a critical point of the nonnegative tensor factorization problem under mild conditions....
A quadratically convergent Bernoulli-like algorithm for solving matrix polynomial equations in Markov chains.
A Quadratically Convergent Jacobi-Like Method for Real Matrices With Complex Eigenvalues.
A Quaternion QR Algorithm.
A rank-one updating approach for solving systems of linear equations in the least squares sense.
A rational canonical form algorithm
We present an easy-to-implement algorithm for transforming a matrix to rational canonical form.
A real-valued block conjugate gradient type method for solving complex symmetric linear systems with multiple right-hand sides
We consider solving complex symmetric linear systems with multiple right-hand sides. We assume that the coefficient matrix has indefinite real part and positive definite imaginary part. We propose a new block conjugate gradient type method based on the Schur complement of a certain 2-by-2 real block form. The algorithm of the proposed method consists of building blocks that involve only real arithmetic with real symmetric matrices of the original size. We also present the convergence property of...
A reduction method for approximate solving large elliptic systems
A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix.
A Relative Backward Perturbation Theorem for the Eigenvalue Problem.
A Relaxation Procedure for Domain Decomposition Methods Using Finite Elements.
A remark on cyclic tridiagonal matrices
A remark on Jordan elimination
A Remark on Simultaneous Inclusions of the Zeros of a Polynomial by Gershgorin's Theorem.
A resultant approach to computing vector characteristics of multiparameter polynomial matrices.
A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization.
A robust spectral method for finding lumpings and meta stable states of non-reversible Markov chains.