Abstract: This paper proposes a decomposition called quaternion scalar and vector norm decomposition (QSVND) for approximation problems in color image processing. Different from traditional quaternion ...

The numerical integration of stiff equations is a challenging problem that needs to be approached by specialized numerical methods. Exponential integrators form a popular class of such methods since ...

Abstract: In this article, the optimal parking trajectory planning problem with chance constraints is considered. A conservative approximation-based method is presented to handle the chance ...

Note: The article usage is presented with a three- to four-day delay and will update daily once available. Due to ths delay, usage data will not appear immediately following publication. Citation ...

For the first time in its 95-year history, the Institute for Advanced Study (IAS) in Princeton, NJ, has appointed a woman as a permanent professor in its School of Mathematics. Last summer, computer ...

Presenting an algorithm that solves linear systems with sparse coefficient matrices asymptotically faster than matrix multiplication for any ω > 2. Our algorithm can be viewed as an efficient, ...

Adequate mathematical modeling is the key to success for many real-world projects in engineering, medicine, and other applied areas. As soon as an appropriate mathematical model is developed, it can ...

Two weeks ago, a modest-looking paper was uploaded to the arXiv preprint server with the unassuming title “On the invariant subspace problem in Hilbert spaces”. The paper is just 13 pages long and its ...

Nathan Brownlowe does not work for, consult, own shares in or receive funding from any company or organization that would benefit from this article, and has disclosed no relevant affiliations beyond ...

The Quadratic Unconstrained Binary Optimization (QUBO) problem is NP-hard. Some exact methods like the Branch-and-Bound algorithm are suitable for small problems. Some approximations like stochastic ...