English
Related papers

Related papers: Dressing Technique for Intermediate Hierarchies

200 papers

In this work we introduce a new multiscale artificial neural network based on the structure of $\mathcal{H}$-matrices. This network generalizes the latter to the nonlinear case by introducing a local deep neural network at each spatial…

Numerical Analysis · Mathematics 2019-11-12 Yuwei Fan , Lin Lin , Lexing Ying , Leonardo Zepeda-Nunez

We develop an alternative systematic approach to the AKNS hierarchy based on elementary algebraic methods. In particular, we recursively construct Lax pairs for the entire AKNS hierarchy by introducing a fundamental polynomial formalism and…

solv-int · Physics 2009-10-30 Fritz Gesztesy , Ratnam Ratnaseelan

A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…

Numerical Analysis · Computer Science 2009-05-25 Cristian Constantin Lalescu

The coupled KP hierarchy, introduced by Hirota and Ohta, are investigated by using the dressing method. It is shown that the coupled KP hierarchy can be reformulated as a reduced case of the 2-component KP hierarchy.

solv-int · Physics 2009-10-31 Saburo Kakei

A regular approach to studying the Lax type integrability of the AKNS hierarchy of nonlinear Lax type integrable dynamical systems in the vertex operator representation is devised. The relationship with the Lie-algebraic integrability…

Exactly Solvable and Integrable Systems · Physics 2011-07-19 D. Blackmore , A. K. Prykarpatsky

A new approach to the construction of general persistent polyhierarchical classifications is proposed. It is based on implicit description of category polyhierarchy by a generating polyhierarchy of classification criteria. Similarly to…

Artificial Intelligence · Computer Science 2007-05-23 Pavel Babikov , Oleg Gontcharov , Maria Babikova

Recently proposed quasi-classical DBAR-dressing method provides a systematic approach to study the weakly dispersive limit of integrable systems. We apply the quasi-classical DBAR-dressing method to describe dispersive corrections of any…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 Boris Konopelchenko , Antonio Moro

We propose a generalized Riemann-Hilbert-Birkhoff decomposition that expands the standard integrable hierarchy formalism in two fundamental ways: it allows for integer powers of Lax matrix components in the flow equations to be increased as…

Exactly Solvable and Integrable Systems · Physics 2025-08-25 H. Aratyn , C. P. Constantinidis , J. F. Gomes , T. C. Santiago , A. H. Zimerman

A new design methodology is introduced, with some examples on building Domain Specific Languages hierarchy on top of Scheme.

Programming Languages · Computer Science 2007-05-23 V. S. Lugovsky

Dunajski generalization of the second heavenly equation is studied. A dressing scheme applicable to Dunajski equation is developed, an example of constructing solutions in terms of implicit functions is considered. Dunajski equation…

Exactly Solvable and Integrable Systems · Physics 2010-11-03 L. V. Bogdanov , V. S. Dryuma , S. V. Manakov

Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there…

Computation · Statistics 2013-01-28 Matthew T. Harrison

The dispersionless limit of the scalar nonlocal dbar-problem is derived. It is given by a special class of nonlinear first-order equations. A quasi-classical version of the dbar-dressing method is presented. It is shown that the algebraic…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 B. Konopelchenko , L. Martinez Alonso , O. Ragnisco

We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…

General Mathematics · Mathematics 2025-07-08 Stanislav Semenov

A dressing scheme applicable to Dunajski equation is developed. Simple example of constructing solutions in terms of implicit functions is considered. Dunajski equation hierarchy is described, its Lax-Sato form is presented. Dunajsky…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 L. V. Bogdanov , V. S. Dryuma , S. V. Manakov

Alternating minimization methods have recently been proposed as alternatives to the gradient descent for deep neural network optimization. Alternating minimization methods can typically decompose a deep neural network into layerwise…

Machine Learning · Computer Science 2020-09-18 Junxiang Wang , Zheng Chai , Yue Cheng , Liang Zhao

We introduce a new bidirectional generalization of (2+1)-dimensional k-constrained KP hierarchy ((2+1)-BDk-cKPH). This new hierarchy generalizes (2+1)-dimensional k-cKP hierarchy, $(t_A,\tau_B)$ and $(\gamma_A,\sigma_B)$ matrix hierarchies.…

Exactly Solvable and Integrable Systems · Physics 2013-12-31 Oleksandr Chvartatskyi , Yuriy Sydorenko

Integrable hierarchies associated with the singular sector of the KP hierarchy, or equivalently, with $\dbar$-operators of non-zero index are studied. They arise as the restriction of the standard KP hierarchy to submanifols of finite…

solv-int · Physics 2007-05-23 Boris G. Konopelchenko , Luis Martinez Alonso , Elena Medina

Since the introduction of the Transformer architecture for large language models, the softmax-based attention layer has faced increasing scrutinity due to its quadratic-time computational complexity. Attempts have been made to replace it…

Machine Learning · Computer Science 2026-02-02 Robert Forchheimer

Hierarchical matrices can be used to construct efficient preconditioners for partial differential and integral equations by taking advantage of low-rank structures in triangular factorizations and inverses of the corresponding stiffness…

Numerical Analysis · Mathematics 2019-06-13 Steffen Börm

Landmark detection for clothes is a fundamental problem for many applications. In this paper, a new training scheme for clothes landmark detection: $\textit{Aggregation and Finetuning}$, is proposed. We investigate the homogeneity among…

Computer Vision and Pattern Recognition · Computer Science 2020-05-04 Tzu-Heng Lin