17,520 research outputs found
Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector
We consider algebraic iterative reconstruction methods with applications in
image reconstruction. In particular, we are concerned with methods based on an
unmatched projector/backprojector pair; i.e., the backprojector is not the
exact adjoint or transpose of the forward projector. Such situations are common
in large-scale computed tomography, and we consider the common situation where
the method does not converge due to the nonsymmetry of the iteration matrix. We
propose a modified algorithm that incorporates a small shift parameter, and we
give the conditions that guarantee convergence of this method to a fixed point
of a slightly perturbed problem. We also give perturbation bounds for this
fixed point. Moreover, we discuss how to use Krylov subspace methods to
efficiently estimate the leftmost eigenvalue of a certain matrix to select a
proper shift parameter. The modified algorithm is illustrated with test
problems from computed tomography
Adaptive BDDC in Three Dimensions
The adaptive BDDC method is extended to the selection of face constraints in
three dimensions. A new implementation of the BDDC method is presented based on
a global formulation without an explicit coarse problem, with massive
parallelism provided by a multifrontal solver. Constraints are implemented by a
projection and sparsity of the projected operator is preserved by a generalized
change of variables. The effectiveness of the method is illustrated on several
engineering problems.Comment: 28 pages, 9 figures, 9 table
Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices
We propose a Preconditioned Locally Harmonic Residual (PLHR) method for
computing several interior eigenpairs of a generalized Hermitian eigenvalue
problem, without traditional spectral transformations, matrix factorizations,
or inversions. PLHR is based on a short-term recurrence, easily extended to a
block form, computing eigenpairs simultaneously. PLHR can take advantage of
Hermitian positive definite preconditioning, e.g., based on an approximate
inverse of an absolute value of a shifted matrix, introduced in [SISC, 35
(2013), pp. A696-A718]. Our numerical experiments demonstrate that PLHR is
efficient and robust for certain classes of large-scale interior eigenvalue
problems, involving Laplacian and Hamiltonian operators, especially if memory
requirements are tight
- …