Related papers: An orthogonality-preserving approach for eigenvalu…
We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the…
In symmetric block eigenvalue algorithms, such as the subspace iteration algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm, a large block size is often employed to achieve robustness and rapid…
For fourth-order geometric evolution equations for planar curves with the dissipation of the bending energy, including the Willmore and the Helfrich flows, we consider a numerical approach. In this study, we construct a structure-preserving…
The scaling of the exact solution of a hyperbolic balance law generates a family of scaled problems in which the source term does not depend on the current solution. These problems are used to construct a sequence of solutions whose…
We consider the numerical integration of moving boundary problems with the curve-shortening property, such as the mean curvature flow and Hele-Shaw flow. We propose a fully discrete curve-shortening polygonal evolution law. The proposed…
In this work, we investigate the convergence of numerical approximations to coercivity constants of variational problems. These constants are essential components of rigorous error bounds for reduced-order modeling; extension of these…
This research is concerned with evolution equations and their forward-backward discretizations. Our first contribution is an estimation for the distance between iterates of sequences generated by forward-backward schemes, useful in the…
A general framework for the numerical approximation of evolution problems is presented that allows to preserve exactly an underlying Hamiltonian- or gradient structure. The approach relies on rewriting the evolution problem in a particular…
We consider a class of multiscale parabolic problems with diffusion coefficients oscillating in space at a possibly small scale $\varepsilon$. Numerical homogenization methods are popular for such problems, because they capture efficiently…
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is…
In this paper we discuss energy conservation issues related to the numerical solution of the nonlinear wave equation. As is well known, this problem can be cast as a Hamiltonian system that may be autonomous or not, depending on the…
We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…
In this paper, we introduce a higher-order multiscale method for time-dependent problems with highly oscillatory coefficients. Building on the localized orthogonal decomposition (LOD) framework, we construct enriched correction operators to…
A positivity-preserving fractional algorithm is presented for solving the four-equation homogeneous relaxation model (HRM) with an arbitrary number of ideal gases and a liquid governed by the stiffened gas equation of state. The fractional…
The spectral renormalization method was introduced in 2005 as an effective way to compute ground states of nonlinear Schr\"odinger and Gross-Pitaevskii type equations. In this paper, we introduce an orthogonal spectral renormalization (OSR)…
We consider the approximation of elliptic eigenvalue problem with an immersed interface. The main aim of this paper is to prove the stability and convergence of an immersed finite element method (IFEM) for eigenvalues using Crouzeix-Raviart…
We propose and analyze volume-preserving parametric finite element methods for surface diffusion, conserved mean curvature flow and an intermediate evolution law in an axisymmetric setting. The weak formulations are presented in terms of…
We introduce an efficient method for computing the Stekloff eigenvalues associated with the Helmholtz equation. In general, this eigenvalue problem requires solving the Helmholtz equation with Dirichlet and/or Neumann boundary condition…
This paper presents a finite element method that preserves (at the degrees of freedom) the eigenvalue range of the solution of tensor-valued time-dependent convection--diffusion equations. Starting from a high-order spatial baseline…
Known algorithms for manipulating octagons do not preserve their sparsity, leading typically to quadratic or cubic time and space complexities even if no relation among variables is known when they are all bounded. In this paper, we present…