Related papers: Iterative Refinement for Diagonalizable Non-Hermit…
We investigate geometric regularization strategies for learned latent representations in encoder--decoder reduced-order models. In a fixed experimental setting for the advection--diffusion--reaction (ADR) equation, we model latent dynamics…
This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated by the demand in material science for developing a tool for…
In this article, we propose a novel regularization method for a class of nonlinear inverse problems that is inspired by an application in quantitative magnetic resonance imaging (qMRI). The latter is a special instance of a general…
How to extract more and useful information for single image super resolution is an imperative and difficult problem. Learning-based method is a representative method for such task. However, the results are not so stable as there may exist…
Based on the work of Xu and Zhou [Math.Comput., 69(2000), pp.881-909], we establish new three-level and multilevel finite element discretizations by local defect-correction technique. Theoretical analysis and numerical experiments show that…
This study presents incremental correction methods for refining neural network parameters or control functions entering into a continuous-time dynamic system to achieve improved solution accuracy in satisfying the interim point constraints…
In this work, we fully explore three refined convergence structures of the lowest-order rectangular Raviart-Thomas element in solving the Laplace eigenvalue problem. Firstly, the scheme possesses a property of supercloseness between the…
The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…
In this paper, three high-accuracy methods for eigenvalues of second order elliptic operators are proposed by using the nonconforming Crouzeix-Raviart(CR for short) element and the nonconforming enriched Crouzeix-Raviart(ECR for short)…
This paper offers a review of numerical methods for computation of the eigenvalues of Hermitian matrices and the singular values of general and some classes of structured matrices. The focus is on the main principles behind the methods that…
We calculate accurate critical parameters for a class of non-hermitian Hamiltonians by means of the diagonalization method. We study three one-dimensional models and two perturbed rigid rotors with PT symmetry. One of the latter models…
This paper uses the HCT finite element method and mesh adaptation technology to solve the nonlinear plate bending problem and conducts error analysis on the iterative method, including a priori and a posteriori error estimates. Our…
We present an intuitive and scalable algorithm for the diagonalization of complex symmetric matrices, which arise from the projection of pseudo--Hermitian and complex scaled Hamiltonians onto a suitable basis set of "trial" states. The…
The implicitly shifted QR iteration is used as a restart procedure for the Arnoldi method for the calculation of a few dominant eigenvalues of a large matrix. We show that the underlying idea of implicit polynomial filtering can be utilized…
First-order methods in convex optimization offer low per-iteration cost but often suffer from slow convergence, while second-order methods achieve fast local convergence at the expense of costly Hessian inversions. In this paper, we…
We investigate the properties of a class of piecewise-fractional maps arising from the introduction of an invariance under rescaling into convex quadratic maps. The subsequent maps are quasiconvex, and pseudoconvex on specific convex cones;…
We propose and analyze a perturbative regularization method to approximate quadratic optimization problems with finite-dimensional degeneracy. The original problem is first approximated by a regularized problem depending on a small positive…
Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…
Regularization is a core component of modern inverse problems, as it helps establish the well-posedness of the solution of interest. Popular regularization approaches include variational regularization and iterative regularization. The…
We consider the solution of large-scale nonlinear algebraic Hermitian eigenproblems of the form $T(\lambda)v=0$ that admit a variational characterization of eigenvalues. These problems arise in a variety of applications and are…