Related papers: On Element SDD Approximability
We solve elliptic systems of equations posed on highly heterogeneous materials. Examples of this class of problems are composite structures and geological processes. We focus on a model problem which is a second-order elliptic equation with…
We extend a localized model order reduction method for the distributed finite element solution of elliptic boundary value problems in the cloud. We give a computationally efficient technique to compute the required inner product matrices…
We propose and analyse a new type of fully discrete surface finite element approximation of a class of linear parabolic stochastic evolution equations with additive noise. Our discretization uses a surface finite element approximation of…
This paper is concerned with two extremal problems from matrix analysis. One is about approximating the top eigenspaces of a Hermitian matrix and the other one about approximating the orthonormal polar factor of a general matrix. Tight…
Based on a quantitative version of the inverse function theorem and an appropriate saddle-point formulation we derive a quasi-optimal error estimate for the finite element approximation of harmonic maps into spheres with a nodal…
We derive the optimal energy error estimate for multiscale finite element method with oversampling technique applying to elliptic system with rapidly oscillating periodic coefficients under the assumption that the coefficients are bounded…
Low rank approximation of matrices has been well studied in literature. Singular value decomposition, QR decomposition with column pivoting, rank revealing QR factorization (RRQR), Interpolative decomposition etc are classical deterministic…
Let $\mathbf{P}=\{ p_1, p_2, \ldots p_n \}$ and $\mathbf{Q} = \{ q_1, q_2 \ldots q_m \}$ be two point sets in an arbitrary metric space. Let $\mathbf{A}$ represent the $m\times n$ pairwise distance matrix with $\mathbf{A}_{i,j} = d(p_i,…
We consider processing an n x d matrix A in a stream with row-wise updates according to a recent algorithm called Frequent Directions (Liberty, KDD 2013). This algorithm maintains an l x d matrix Q deterministically, processing each row in…
We study the approximation of stationary processes by a simple class of purely deterministic signals. This has an analytic counterpart in the approximation of symmetric positive definite Toeplitz matrices by submatrices of finite rank. We…
In this paper, we examine the problem of approximating a general linear dimensionality reduction (LDR) operator, represented as a matrix $A \in \mathbb{R}^{m \times n}$ with $m < n$, by a partial circulant matrix with rows related by…
In this paper, we study an adaptive finite element method for a class of a nonlinear eigenvalue problems that may be of nonconvex energy functional and consider its applications to quantum chemistry. We prove the convergence of adaptive…
The randomized SVD is a method to compute an inexpensive, yet accurate, low-rank approximation of a matrix. The algorithm assumes access to the matrix through matrix-vector products (matvecs). Therefore, when we would like to apply the…
We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a…
The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed…
This paper focuses on numerical approximation for fractional powers of elliptic operators on $2$-d manifolds. Firstly, parametric finite element method is employed to discretize the original problem. We then approximate fractional powers of…
We generalize the three two-particle Bethe-Salpeter equations to ten three-particle ladders. These equations are exact and yield the exact three-particle vertex, if we knew the three-particle vertex irreducible in one of the ten channels.…
A numerical analysis for the fully discrete approximation of an operator Lyapunov equation related to linear SPDEs (stochastic partial differential equations) driven by multiplicative noise is considered. The discretization of the Lyapunov…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We develop a method to compute $H^2$-conforming finite element approximations in both two and three space dimensions using readily available finite element spaces. This is accomplished by deriving a novel, equivalent mixed variational…