English
Related papers

Related papers: A non-iterative straightening algorithm and orthog…

200 papers

This work investigates a Bregman and inertial extension of the forward-reflected-backward algorithm [Y. Malitsky and M. Tam, SIAM J. Optim., 30 (2020), pp. 1451--1472] applied to structured nonconvex minimization problems under relative…

Optimization and Control · Mathematics 2024-04-17 Ziyuan Wang , Andreas Themelis , Hongjia Ou , Xianfu Wang

We present a generalization of the classical Schur modules of $GL(N)$ exhibiting the same interplay among algebra, geometry, and combinatorics. A generalized Young diagram $D$ is an arbitrary finite subset of $\NN \times \NN$. For each $D$,…

alg-geom · Mathematics 2015-06-30 Peter Magyar

The explicit split-operator algorithm is often used for solving the linear and nonlinear time-dependent Schr\"{o}dinger equations. However, when applied to certain nonlinear time-dependent Schr\"{o}dinger equations, this algorithm loses…

Chemical Physics · Physics 2024-09-26 Julien Roulet , Jiří Vaníček

We propose a high-precision numerical quadrature framework based on local Fourier extension (LFE) approximations. The method constructs, on each subinterval, a truncated-SVD stabilized local Fourier continuation of the integrand on an…

Numerical Analysis · Mathematics 2026-03-17 Xinran Liu , Zhenyu Zhao , Benxue Gong

Recently, we introduced a new class of shapes, called soft cells which fill space as soft tilings without gaps and overlaps while minimizing the number of sharp corners. We introduced the edge bending algorithm that deforms a polyhedral…

Computational Geometry · Computer Science 2025-04-09 Gábor Domokos , Alain Goriely , Ákos G. Horváth , Krisztina Regős

This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber…

Optimization and Control · Mathematics 2024-10-10 Ling Liang , Defeng Sun , Kim-Chuan Toh

We consider a new semidefinite programming relaxation for directed edge expansion, which is obtained by adding triangle inequalities to the reweighted eigenvalue formulation. Applying the matrix multiplicative weight update method to this…

Data Structures and Algorithms · Computer Science 2023-06-16 Lap Chi Lau , Kam Chuen Tung , Robert Wang

We examine the interaction of multigrid methods and shape optimization in appropriate shape spaces. Our aim is a scalable algorithm for application on supercomputers, which can only be achieved by mesh-independent convergence. The impact of…

Optimization and Control · Mathematics 2021-04-12 Martin Siebenborn , Kathrin Welker

We give an algorithm for working out the indecomposable direct summands in a Krull--Schmidt decomposition of a tensor product of two simple modules for G=SL_3 in characteristics 2 and 3. It is shown that there is a finite family of modules…

Representation Theory · Mathematics 2010-10-26 C. Bowman , S. R. Doty , S. Martin

This work explores the application of the fast assembly and formation strategy from [8, 17] to trimmed bi-variate parameter spaces. Two concepts for the treatment of basis functions cut by the trimming curve are investigated: one employs a…

Computational Engineering, Finance, and Science · Computer Science 2023-08-29 Benjamin Marussig

A formulation of the asymptotically exact first-order shear deformation theory for linear-elastic homogeneous plates in the rescaled coordinates and rotation angles is considered. This allows the development of its asymptotically accurate…

Numerical Analysis · Mathematics 2024-04-17 Khanh Chau Le , Hoang Giang Bui

We consider an initial-boundary value problem for a 2D time-dependent Schr\"odinger equation on a semi-infinite strip. For the Numerov-Crank-Nicolson finite-difference scheme with discrete transparent boundary conditions, the Strang-type…

Numerical Analysis · Mathematics 2026-01-05 Alexander Zlotnik , Alla Romanova

This paper is a sequel to "Computing diagonal form and Jacobson normal form of a matrix using Groebner bases", J. of Symb. Computation, 46 (5), 2011. We present a new fraction-free algorithm for the computation of a diagonal form of a…

Rings and Algebras · Mathematics 2017-12-06 Viktor Levandovskyy , Kristina Schindelar

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

Data Structures and Algorithms · Computer Science 2013-07-09 Frederique Bassino , Andrea Sportiello

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

Combinatorics · Mathematics 2022-03-17 Florence Maas-Gariépy , Étienne Tétreault

We consider Schur function expansion for the partition function of the model of normal matrices. We show that this expansion coincides with Takasaki expansion \cite{Tinit} for tau functions of Toda lattice hierarchy. We show that the…

Mathematical Physics · Physics 2009-11-11 A. Yu. Orlov , T. Shiota

We construct a vertex model whose partition function is a refined dual Grothendieck polynomial, where the states are interpreted as nonintersecting lattice paths. Using this, we show refined dual Grothendieck polynomials are multi-Schur…

Combinatorics · Mathematics 2021-01-01 Kohei Motegi , Travis Scrimshaw

Let $C$ be a symmetrizable generalized Cartan matrix with symmetrizer $D$ and orientation $\Omega$. In previous work we associated an algebra $H$ to this data, such that the locally free $H$-modules behave in many aspects like…

Representation Theory · Mathematics 2020-08-27 Christof Geiß , Bernard Leclerc , Jan Schröer

Higher order schemes for stochastic partial differential equations that do not possess commutative noise require the simulation of iterated stochastic integrals. In this work, we propose a derivative-free Milstein type scheme to approximate…

Probability · Mathematics 2020-06-16 Claudine von Hallern , Andreas Rößler

Let G be GL_N or SL_N as reductive linear algebraic group over a field k of positive characteristic p. We prove several results that were previously established only when N < 6 or p > 2^N. Let G act rationally on a finitely generated…

Representation Theory · Mathematics 2009-09-29 Vasudevan Srinivas , Wilberd van der Kallen