相关论文: Damping factors for the gap-tooth scheme

Schemes with the second-order approximation in time are considered for numerical solving the Cauchy problem for an evolutionary equation of first order with a self-adjoint operator. The implicit two-level scheme based on the Pad\'{e}…

We propose a finite volume scheme for a class of nonlinear parabolic equations endowed with non-homogeneous Dirichlet boundary conditions and which admit relative en-tropy functionals. For this kind of models including porous media…

Dimension reduction algorithms are a crucial part of many data science pipelines, including data exploration, feature creation and selection, and denoising. Despite their wide utilization, many non-linear dimension reduction algorithms are…

We discuss the distributed matching scheme in accelerators where control of transverse beam phase space, oscillation, and transport is accomplished by flexible distribution of focusing elements beyond dedicated matching sections. Besides…

We present an alternative "encapsulated" formulation of the Selective Frequency Damping method for finding unstable equilibria of dynamical systems, which is particularly useful when analysing the stability of fluid flows. The formulation…

Many interesting physical problems described by systems of hyperbolic conservation laws are stiff, and thus impose a very small time-step because of the restrictive CFL stability condition. In this case, one can exploit the superior…

This work combines the consistency in lower-order differential operators with external approximations of functional spaces to obtain error estimates for finite difference finite volume schemes on unstructured non-uniform meshes. This…

Distributed Constraint Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by different agents. Many multi-agent problems include…

We study the real time dynamics of a quantum system with potential barrier coupled to a heat-bath environment. Employing the path integral approach an evolution equation for the time dependent density matrix is derived. The time evolution…

In the harmonic description of general relativity, the principle part of Einstein's equations reduces to 10 curved space wave equations for the componenets of the space-time metric. We present theorems regarding the stability of several…

In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures…

We investigate the effectiveness of different dynamical decoupling protocols for storage of a single qubit in the presence of a purely dephasing bosonic bath, with emphasis on comparing quantum coherence preservation under uniform vs.…

In distributed optimization problems, a technique called gradient coding, which involves replicating data points, has been used to mitigate the effect of straggling machines. Recent work has studied approximate gradient coding, which…

We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applications in biology and social sciences…

We present a temporal decomposition scheme for solving long-horizon optimal control problems. In the proposed scheme, the time domain is decomposed into a set of subdomains with partially overlapping regions. Subproblems associated with the…

In this paper, we analyze a semi-discrete finite difference scheme for a conservation laws driven by a homogeneous multiplicative Levy noise. Thanks to BV estimates, we show a compact sequence of approximate solutions, generated by the…

In this paper, we propose a uniformly dithered 1-bit quantization scheme for high-dimensional statistical estimation. The scheme contains truncation, dithering, and quantization as typical steps. As canonical examples, the quantization…

In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring…

This article derives lower bounds on the convergence rate of continuous-time gradient-based optimization algorithms. The algorithms are subjected to a time-normalization constraint that avoids a reparametrization of time in order to make…

Many large-scale and distributed optimization problems can be brought into a composite form in which the objective function is given by the sum of a smooth term and a nonsmooth regularizer. Such problems can be solved via a proximal…