Related papers: Solving a Class of Infinite-Dimensional Tensor Eig…
One of the most used approaches in simulating materials is the tight-binding approximation. When using this method in a material simulation, it is necessary to compute the eigenvalues and eigenvectors of the Hamiltonian describing the…
This paper is concerned with the design and analysis of a fully adaptive eigenvalue solver for linear symmetric operators. After transforming the original problem into an equivalent one formulated on $\ell_2$, the space of square summable…
Tensor ring (TR) decomposition has been successfully used to obtain the state-of-the-art performance in the visual data completion problem. However, the existing TR-based completion methods are severely non-convex and computationally…
We present a novel approach for the inverse problem in electrical impedance tomography based on regularized quadratic regression. Our contribution introduces a new formulation for the forward model in the form of a nonlinear integral…
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
Recent advances in IoT and biometric sensing technologies have led to the generation of massive and high-dimensional tensor data, yet achieving accurate and efficient low-rank approximation remains a major challenge. Most existing tensor…
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…
Real-world physical systems, like composite materials and porous media, exhibit complex heterogeneities and multiscale nature, posing significant computational challenges. Computational homogenization is useful for predicting macroscopic…
Efficient solvers for tensor eigenvalue problems are important tools for the analysis of higher-order data sets. Here we introduce, analyze and demonstrate an extrapolation method to accelerate the widely used shifted symmetric higher order…
Contour-integral-based rational filter leads to interior eigensolvers for non-Hermitian generalized eigenvalue problems. Based on Zolotarev's third problem, this paper proves the asymptotic optimality of the trapezoidal quadrature of the…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
In this paper, we introduce a tensor neural network based machine learning method for solving the elliptic partial differential equations with random coefficients in a bounded physical domain. With the help of tensor product structure, we…
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning of large-scale overdetermined…
Let $\left( X,\left\Vert \cdot\right\Vert_{X}\right) $ and $\left( Y,\left\Vert \cdot\right\Vert_{Y}\right) $ be Banach spaces over $\mathbb{R},$ with $X$ uniformly convex and compactly embedded into $Y.$ The inverse iteration method is…
We investigate the relation between the spectrum of a non-normal matrix and the norm of its resolvent. We provide spectral estimates for the resolvent of matrices whose largest singular value is bounded by $1$ (so-called Hilbert space…
Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $\lambda$ and a hermitian matrix $M$, this…
In tensor completion tasks, the traditional low-rank tensor decomposition models suffer from the laborious model selection problem due to their high model sensitivity. In particular, for tensor ring (TR) decomposition, the number of model…
This paper considers the completion problem for a tensor (also referred to as a multidimensional array) from limited sampling. Our greedy method is based on extending the low-rank approximation pursuit (LRAP) method for matrix completions…
Kernel dimensionality reduction (KDR) algorithms find a low dimensional representation of the original data by optimizing kernel dependency measures that are capable of capturing nonlinear relationships. The standard strategy is to first…