Related papers: Improved Implementation of Approximate Full Mass M…

The recent evolution of software and hardware technologies is leading to a renewed computational interest in Particle-In-Cell (PIC) methods such as the Material Point Method (MPM). Indeed, provided some critical aspects are properly…

We consider matrix factorization (MF) with certain constraints, which finds wide applications in various areas. Leveraging variational inference (VI) and unitary approximate message passing (UAMP), we develop a Bayesian approach to MF with…

This paper proposes an efficient method for computing partial eigenvalues of large sparse matrices what can be called the inexact inverse power method (IIPM). It is similar to the inexact Rayleigh quotient method and inexact Jacobi-Davidson…

The Anderson Mixing (AM) method is a popular approach for accelerating fixed-point iterations by leveraging historical information from previous steps. In this paper, we introduce the Riemannian Anderson Mixing (RAM) method, an extension of…

Robust matrix completion aims to recover a low-rank matrix from a subset of noisy entries perturbed by complex noises, where traditional methods for matrix completion may perform poorly due to utilizing $l_2$ error norm in optimization. In…

This paper presents a new approach on stretch processing for a fine range estimation using MPM (Matrix Pencil Method). The conventional method utilizes FFT (Fast Fourier Transform) with limited range resolution with its fixed number of…

A novel multi-resolution technique called border mapping multi-resolution (BMMR) is proposed for projection-based particle methods. The BMMR aims to obtain background equivalent particle distributions in the two sides of a border between…

The sum of radii problem ($k$-MSR) asks, given a metric space on $n$ points, to place $k$ balls covering all points so as to minimize the sum of their radii. Despite extensive study from the perspectives of approximation and parameterized…

Partially observable Markov decision processes (POMDPs) is a rich mathematical framework that embraces a large class of complex sequential decision-making problems under uncertainty with limited observations. However, the complexity of…

This paper proposes a learning-based approach to accelerate the interior-point method (IPM) for solving optimal power flow (OPF) problems by learning the structure of the IPM central path from its early stable iterations. Unlike traditional…

We study the quadratic penalty method (QPM) for smooth nonconvex optimization problems with equality constraints. Assuming the constraint violation satisfies the PL condition near the feasible set, we derive sharper worst-case complexity…

We develop novel numerical methods and perturbation approaches to determine the mean first passage time (MFPT) for a Brownian particle to be captured by either small stationary or mobile traps inside a bounded 2-D confining domain. Of…

Electronic structure calculations based on density-functional theory (DFT) represent a significant part of today's HPC workloads and pose high demands on high-performance computing resources. To perform these quantum-mechanical DFT…

First-order operator splitting methods are ubiquitous among many fields through science and engineering, such as inverse problems, signal/image processing, statistics, data science and machine learning, to name a few. In this paper, we…

This paper proposes Inverse Gram Matrix (IGM) methods to prioritize the Pairwise Reciprocal Matrix (PRM) in the Analytic Hierarchy Process. The IGM methods include Pseudo-IGM, Normalized-IGM, and Lagrange-IGM. Interestingly, the proposed…

Trapped-ion systems are a promising route toward the realization of both near-term and universal quantum computers. However, one of the pressing challenges is improving the fidelity of two-qubit entangling gates. These operations are often…

The long-range magnetic field is the most time-consuming part in micromagnetic simulations. Improvements both on a numerical and computational basis can relief problems related to this bottleneck. This work presents an efficient…

We propose and show the efficacy of a new method to address generic inverse problems. Inverse modeling is the task whereby one seeks to determine the control parameters of a natural system that produce a given set of observed measurements.…

Inverse linear programming (LP) has received increasing attention due to its potential to generate efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and…

Explicit time advancement for continuous finite elements requires the inversion of a global mass matrix. For spectral element simulations on quadrilaterals and hexahedra, there is an accurate approximate mass matrix which is diagonal,…