English
Related papers

Related papers: Existence, uniqueness and a constructive solution …

200 papers

Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…

Numerical Analysis · Mathematics 2022-09-05 Margherita Porcelli , Valeria Simoncini

Robust discrete optimization is a highly active field of research where a plenitude of combinations between decision criteria, uncertainty sets and underlying nominal problems are considered. Usually, a robust problem becomes harder to…

Optimization and Control · Mathematics 2022-01-14 Marc Goerigk , Mohammad Khosravi

Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several…

Quantum Physics · Physics 2013-02-25 T. H. Johnson , J. D. Biamonte , S. R. Clark , D. Jaksch

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

Data Structures and Algorithms · Computer Science 2020-02-10 Mario Pennacchioni , Emanuele Munarini , Marco Mesiti

The problem of constructing optimal AIFV codes is a special case of that of constructing minimum cost Markov Chains. This paper provides the first complete proof of correctness for the previously known iterative algorithm for constructing…

Data Structures and Algorithms · Computer Science 2024-07-08 Reza Hosseini Dolatabadi , Mordedcai J. Golin , Arian Zamani

We study from a theoretical viewpoint the fundamental problem of efficiently computing the stationary distribution of general classes of structured Markov processes. In strong contrast with previous work, we consider this fundamental…

Quantum Physics · Physics 2025-06-18 Vasileios Kalantzis , Mark S. Squillante , Shashanka Ubaru

In this paper, we consider a class of nonlinear Choquard equations with critical growth, and we show the existence of solutions of the equations. Besides, we consider the corresponding minimizing problem and prove the existence of a…

Analysis of PDEs · Mathematics 2016-09-20 Yong Ao

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…

Computational Complexity · Computer Science 2019-06-18 Victor Lagerkvist , Gustav Nordh

We use one-step conditional risk mappings to formulate a risk averse version of a total cost problem on a controlled Markov process in discrete time infinite horizon. The nonnegative one step costs are assumed to be lower semi-continuous…

Optimization and Control · Mathematics 2018-06-05 Kerem Ugurlu

In this paper we investigate the existence of solutions and their weak-strong uniqueness property for a PDE system modelling damage in viscoelastic materials. In fact, we address two solution concepts, weak and strong solutions. For the…

Analysis of PDEs · Mathematics 2024-09-04 Robert Lasarzik , Elisabetta Rocca , Riccarda Rossi

We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…

Numerical Analysis · Mathematics 2013-08-01 Felipe Cucker , Javier Peña , Vera Roshchina

In earlier work we have studied a method for discretization in time of a parabolic problem which consists in representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In…

Numerical Analysis · Mathematics 2016-02-02 William McLean , Vidar Thomée

In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…

q-alg · Mathematics 2008-02-03 Charilaos Aneziris

The main thrust of our current work is to exploit very specific characteristics of a given problem in order to acquire improved compactness for supercritical problems and to prove existence of new types of solutions. To this end, we shall…

Analysis of PDEs · Mathematics 2022-06-28 Craig Cowan , Abbas Moameni

In recent years, finding new satisfiability algorithms for various circuit classes has been a very active line of research. Despite considerable progress, we are still far away from a definite answer on which circuit classes allow fast…

Computational Complexity · Computer Science 2013-06-19 Stefan Schneider

Many studies on the cost-sensitive learning assumed that a unique cost matrix is known for a problem. However, this assumption may not hold for many real-world problems. For example, a classifier might need to be applied in several…

Machine Learning · Computer Science 2012-05-03 Rui Wang , Ke Tang

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Group Theory · Mathematics 2018-11-08 Rita Gitik

This article establishes the existence of weak solutions for a class of mixed local-nonlocal problems with pure and perturbed singular nonlinearities. A key novelty is the treatment of variable singular exponents alongside measure-valued…

Analysis of PDEs · Mathematics 2025-07-08 Sanjit Biswas , Prashanta Garain

In this paper, we present the solution to Kolmogorov's problem for the classes of multiply monotone and completely monotone functions together with its connections to the Markov moment problem, Hermite-Birkhoff interpolation problem, and…

Functional Analysis · Mathematics 2015-09-18 Vladyslav Babenko , Yuliya Babenko , Oleg Kovalenko

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

Computational Complexity · Computer Science 2018-10-01 Noson S. Yanofsky