Related papers: Equi-affine minimal-degree moving frames for polyn…
The convergence analysis for least-squares finite element methods led to various adaptive mesh-refinement strategies: Collective marking algorithms driven by the built-in a posteriori error estimator or an alternative explicit…
We consider practical aspects of reconstructing planar curves with prescribed Euclidean or affine curvatures. These curvatures are invariant under the special Euclidean group and the equi-affine groups, respectively, and play an important…
In this paper we consider the spatial semi-discretization of conservative PDEs. Such finite dimensional approximations of infinite dimensional dynamical systems can be described as flows in suitable matrix spaces, which in turn leads to the…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably converge with a linear rate when: i) the feasible set is a…
In this thesis, we present various contributions to the study of free boundary minimal surfaces. After introducing some basic tools and discussing some delicate aspects related to the definition of Morse index when allowing for a contact…
The quantum lens spaces form a natural and well-studied class of noncommutative spaces which can be subjected to classification using algebraic invariants by drawing on the fully developed classification theory of unital graph…
The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
In this paper, we present an interior point algorithm with a full-Newton step for solving a linearly constrained convex optimization problem, in which we propose a generalization of the work of Kheirfam and Nasrollahi…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…
We consider the problem of domain approximation in finite element methods for Maxwell equations on curved domains, i.e., when affine or polynomial meshes fail to exactly cover the domain of interest. In such cases, one is forced to…
We present a technique novel in numerical methods. It compiles the domain of the numerical methods as a discretized volume. Congruent elements are glued together to compile the domain over which the solution of a boundary value problem of a…
Since the 1960's the finite element method emerged as a powerful tool for the numerical simulation of countless physical phenomena or processes in applied sciences. One of the reasons for this undeniable success is the great versatility of…