This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We give necessary and sufficient conditions in terms of sign vectors for the injectivity of families of polynomial maps with arbitrary real exponents defined on the positive orth...
The method of alternating projections is a classical tool to solve feasibility problems. Here we prove local convergence of alternating projections between subanalytic sets A, B u...
We rigorously study a novel type of trigonometric Fourier collocation methods for solving multi-frequency oscillatory second-order ordinary differential equations (ODEs) q (t) + M...
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster ...
Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix M, the goal is to comp...