Related papers: Generic Regular Decompositions for Parametric Poly…
The paper introduces and studies the notions of Lipschitzian and H\"olderian full stability of solutions to three-parametric variational systems described in the generalized equation formalism involving nonsmooth base mappings and partial…
Effective methods are introduced for testing zero-dimensionality of varieties at a point. The motivation of this paper is to compute and analyze deformations of isolated hypersurface singularities. As an application, methods for computing…
We introduce a novel approach for analyzing the training dynamics of ReLU networks by examining the characteristic activation boundaries of individual ReLU neurons. Our proposed analysis reveals a critical instability in common neural…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
At low energies, the microscopic characteristics and changes of physical systems as viewed at different distance scales are described by universal scale invariant properties investigated by the Renormalization Group (RG) apparatus, an…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
An approximation algorithm is proposed to transform truncated QCD (or QED) series for observables. The approximation is a modification of the Baker-Gammel approximants, and is independent of the renormalization scale (RScl) $\mu$ -- the…
We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…
We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent…
In this article, we demonstrate the novel use of Proper Generalized Decomposition (PGD) to separate the axial and, optionally, polar dimensions of neutron transport. Doing so, the resulting Reduced-Order Models (ROMs) can exploit the fact…
We use dense variable-ordering to define HRD (Hybrid-Restriction Diagram), a new BDD-like data-structure for the representation and manipulation of state-spaces of linear hybrid automata. We present and discuss various manipulation…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
Reduced order models (ROM) are commonly employed to solve parametric problems and to devise inexpensive response surfaces to evaluate quantities of interest in real-time. There are many families of ROMs in the literature and choosing among…
Recently, Meta-Auto-Decoder (MAD) was proposed as a novel reduced order model (ROM) for solving parametric partial differential equations (PDEs), and the best possible performance of this method can be quantified by the decoder width. This…
The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary differential equations (ODEs) with coefficients that are…
We introduce a class of variational states to describe quantum many-body systems. This class generalizes matrix product states which underly the density-matrix renormalization group approach by combining them with weighted graph states.…
Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. As the capacity of hard disks…
Implicit regularization refers to the tendency of local search algorithms to converge to low-dimensional solutions, even when such structures are not explicitly enforced. Despite its ubiquity, the mechanism underlying this behavior remains…
Based on the matrix expression of general nonlinear numerical analogues presented by the present author, this paper proposes a novel philosophy of nonlinear computation and analysis. The nonlinear problems are considered an ill-posed linear…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…