Related papers: Tensor GMRES and Golub-Kahan Bidiagonalization met…
This paper extends the Bernstein-Gelfand-Gelfand (BGG) framework to the construction of finite element conformal Hessian complexes and conformal elasticity complexes in three dimensions involving conformal tensors (i.e., symmetric and…
For the large-scale linear discrete ill-posed problem $\min\|Ax-b\|$ or $Ax=b$ with $b$ contaminated by Gaussian white noise, the Lanczos bidiagonalization based Krylov solver LSQR and its mathematically equivalent CGLS, the Conjugate…
The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables, similarly as in the solution of the Vlasov-Poisson system by means of the Bernstein-Greene-Kruskal method. In the…
Randomized iterative algorithms, such as the randomized Kaczmarz method, have gained considerable popularity due to their efficacy in solving matrix-vector and matrix-matrix regression problems. Our present work leverages the insights…
We consider a space-time variational formulation of parabolic initial-boundary value problems in anisotropic Sobolev spaces in combination with a Hilbert-type transformation. This variational setting is the starting point for the space-time…
We develop a formalism to treat higher order (nonlinear) metric perturbations of the Kerr spacetime in a Teukolsky framework. We first show that solutions to the linearized Einstein equation with nonvanishing stress tensor can be decomposed…
This paper presents an efficient algorithm to solve total variation (TV) regularizations of images contaminated by a both blur and noise. The unconstrained structure of the problem suggests that one can solve a constrained optimization…
In this paper, we consider Nesterov's Accelerated Gradient method for solving Nonlinear Inverse and Ill-Posed Problems. Known to be a fast gradient-based iterative method for solving well-posed convex optimization problems, this method also…
A generalized covariant method of analysis applicable to frames for which time is not orthogonal to space, such as spacetime around a star possessing angular momentum or on a rotating disk, is presented. Important aspects of such an…
This work proposes a new class of preconditioners for the low rank Generalized Minimal Residual Method (GMRES) for multiterm matrix equations arising from implicit timestepping of linear matrix differential equations. We are interested in…
Since most inverse problems arising in scientific and engineering applications are ill-posed, prior information about the solution space is incorporated, typically through regularization, to establish a well-posed problem with a unique…
Implicit neural representations (INRs) have significantly advanced the field of arbitrary-scale super-resolution (ASSR) of images. Most existing INR-based ASSR networks first extract features from the given low-resolution image using an…
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step.…
Recently, the Grassmann-tensor-entanglement renormalization group(GTERG) approach was proposed as a generic variational approach to study strongly correlated boson/fermion systems. However, the weakness of such a simple variational approach…
Performing Bayesian inference on large spatio-temporal models requires extracting inverse elements of large sparse precision matrices for marginal variances, as well as estimating model hyperparameters. Although direct matrix factorizations…
The Reynolds equation, combined with the Elrod algorithm for including the effect of cavitation, resembles a nonlinear convection-diffusion-reaction (CDR) equation. Its solution by finite elements is prone to oscillations in…
New algorithms are proposed for the Tucker approximation of a 3-tensor, that access it using only the tensor-by-vector-by-vector multiplication subroutine. In the matrix case, Krylov methods are methods of choice to approximate the dominant…
This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the…
We study the Godunov scheme for a nonlinear Maxwell model arising in nonlinear optics, the Kerr model. This is a hyperbolic system of conservation laws with some eigenvalues of variable multiplicity, neither genuinely nonlinear nor linearly…
This paper introduces and studies the convergence properties of a new class of explicit $\epsilon$-subgradient methods for the task of minimizing a convex function over the set of minimizers of another convex minimization problem. The…