Related papers: A structure preserving Lanczos algorithm for compu…
An infinite dimensional canonical symplectic structure and structure-preserving geometric algorithms are developed for the photon-matter interactions described by the Schr\"odinger-Maxwell equations. The algorithms preserve the symplectic…
We show that the standard Lanczos algorithm can be efficiently implemented statistically and self consistently improved, using the stochastic reconfigurat ion method, which has been recently introduced to stabilize the Monte Carlo sign…
The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals…
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…
The application of the context-adaptive entropy model significantly improves the rate-distortion (R-D) performance, in which hyperpriors and autoregressive models are jointly utilized to effectively capture the spatial redundancy of the…
We present a novel implicit scheme for the numerical solution of time-dependent conservation laws. The core idea of the presented method is to exploit and approximate the mixed spatial-temporal derivative of the solution that occurs…
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an…
State space models (SSMs) have recently emerged as an alternative to transformers due to their unique ability of modeling global relationships in text with linear complexity. However, their success in vision tasks has been limited due to…
We derive and implement an alternative formulation of the Stochastic Lanczos algorithm to be employed in connection with the Many-Body Dispersion model (MBD). Indeed, this formulation, which is only possible due to the Stochastic Lanczos'…
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to…
In order to realize the significant potential of optical materials such as metal halides, computational techniques which give accurate optical properties are needed, which can work hand-in-hand with experiments to generate high efficiency…
We describe a new algorithm for trajectory optimization of mechanical systems. Our method combines pseudo-spectral methods for function approximation with variational discretization schemes that exactly preserve conserved mechanical…
In this paper, we propose stochastic structure-preserving schemes to compute the effective diffusivity for particles moving in random flows. We first introduce the motion of particles using the Lagrangian formulation, which is modeled by…
Anterior segment optical coherence tomography (AS-OCT) is a non-invasive imaging technique that is highly valuable for ophthalmic diagnosis. However, speckles in AS-OCT images can often degrade the image quality and affect clinical…
This paper proposes a harmonic Lanczos bidiagonalization method for computing some interior singular triplets of large matrices. It is shown that the approximate singular triplets are convergent if a certain Rayleigh quotient matrix is…
This paper proposes a new large-scale mask-compliant spectral precoder (LS-MSP) for orthogonal frequency division multiplexing systems. In this paper, we first consider a previously proposed mask-compliant spectral precoding scheme that…
We construct the complete structural phase diagram of polymer adsorption at substrates with attractive stripe-like patterns in the parameter space spanned by the adsorption affinity of the stripes and temperature. Results were obtained by…
In this paper, we present a new approach for model reduction of large scale first and second order dynamical systems with multiple inputs and multiple outputs (MIMO). This approach is based on the projection of the initial problem onto…
We present a new adaptive method for electronic structure calculations based on novel fast algorithms for reduction of multivariate mixtures. In our calculations, spatial orbitals are maintained as Gaussian mixtures whose terms are selected…
The simulation of diffusion-based molecular communication systems with absorbing receivers often requires a high computational complexity to produce accurate results. In this work, a new a priori Monte Carlo (APMC) algorithm is proposed to…