102,511 research outputs found
Decomposition of multiport elements in a revised multibond graph notation
Decomposition rules are derived for multiport-transformers, -resistors, -storage elements and -gyrators into 1- and 2-port elements, junctions and bonds. It appears that it is useful to extend the vectorbond, or rather multibond, notation recently proposed by the author with a âmultibond arrayâ. Canonical forms are introduced on the basis of minimal realization, because decompositions of multiport elements are not unique. A new type of coupling factor (âdirected coupling factorâ) is introduced for multiport-resistors and capacitors
Canonical decomposition of linear differential operators with selected differential Galois groups
We revisit an order-six linear differential operator having a solution which
is a diagonal of a rational function of three variables. Its exterior square
has a rational solution, indicating that it has a selected differential Galois
group, and is actually homomorphic to its adjoint. We obtain the two
corresponding intertwiners giving this homomorphism to the adjoint. We show
that these intertwiners are also homomorphic to their adjoint and have a simple
decomposition, already underlined in a previous paper, in terms of order-two
self-adjoint operators. From these results, we deduce a new form of
decomposition of operators for this selected order-six linear differential
operator in terms of three order-two self-adjoint operators. We then generalize
the previous decomposition to decompositions in terms of an arbitrary number of
self-adjoint operators of the same parity order. This yields an infinite family
of linear differential operators homomorphic to their adjoint, and, thus, with
a selected differential Galois group. We show that the equivalence of such
operators is compatible with these canonical decompositions. The rational
solutions of the symmetric, or exterior, squares of these selected operators
are, noticeably, seen to depend only on the rightmost self-adjoint operator in
the decomposition. These results, and tools, are applied on operators of large
orders. For instance, it is seen that a large set of (quite massive) operators,
associated with reflexive 4-polytopes defining Calabi-Yau 3-folds, obtained
recently by P. Lairez, correspond to a particular form of the decomposition
detailed in this paper.Comment: 40 page
Nearest-Neighbor Interaction Systems in the Tensor-Train Format
Low-rank tensor approximation approaches have become an important tool in the
scientific computing community. The aim is to enable the simulation and
analysis of high-dimensional problems which cannot be solved using conventional
methods anymore due to the so-called curse of dimensionality. This requires
techniques to handle linear operators defined on extremely large state spaces
and to solve the resulting systems of linear equations or eigenvalue problems.
In this paper, we present a systematic tensor-train decomposition for
nearest-neighbor interaction systems which is applicable to a host of different
problems. With the aid of this decomposition, it is possible to reduce the
memory consumption as well as the computational costs significantly.
Furthermore, it can be shown that in some cases the rank of the tensor
decomposition does not depend on the network size. The format is thus feasible
even for high-dimensional systems. We will illustrate the results with several
guiding examples such as the Ising model, a system of coupled oscillators, and
a CO oxidation model
Engineering Stable Discrete-Time Quantum Dynamics via a Canonical QR Decomposition
We analyze the asymptotic behavior of discrete-time, Markovian quantum
systems with respect to a subspace of interest. Global asymptotic stability of
subspaces is relevant to quantum information processing, in particular for
initializing the system in pure states or subspace codes. We provide a
linear-algebraic characterization of the dynamical properties leading to
invariance and attractivity of a given quantum subspace. We then construct a
design algorithm for discrete-time feedback control that allows to stabilize a
target subspace, proving that if the control problem is feasible, then the
algorithm returns an effective control choice. In order to prove this result, a
canonical QR matrix decomposition is derived, and also used to establish the
control scheme potential for the simulation of open-system dynamics.Comment: 12 pages, 1 figur
Stability and singularities of relative hypersurfaces
We study relative hypersurfaces, and prove an instability condition for the fibres. This
is the starting point for an investigation of the geometry of effective divisors on relative
projective bundles.Preprin
Tensor Numerical Methods in Quantum Chemistry: from Hartree-Fock Energy to Excited States
We resume the recent successes of the grid-based tensor numerical methods and
discuss their prospects in real-space electronic structure calculations. These
methods, based on the low-rank representation of the multidimensional functions
and integral operators, led to entirely grid-based tensor-structured 3D
Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core
Hamiltonian and two-electron integrals (TEI) in complexity using
the rank-structured approximation of basis functions, electron densities and
convolution integral operators all represented on 3D
Cartesian grids. The algorithm for calculating TEI tensor in a form of the
Cholesky decomposition is based on multiple factorizations using algebraic 1D
``density fitting`` scheme. The basis functions are not restricted to separable
Gaussians, since the analytical integration is substituted by high-precision
tensor-structured numerical quadratures. The tensor approaches to
post-Hartree-Fock calculations for the MP2 energy correction and for the
Bethe-Salpeter excited states, based on using low-rank factorizations and the
reduced basis method, were recently introduced. Another direction is related to
the recent attempts to develop a tensor-based Hartree-Fock numerical scheme for
finite lattice-structured systems, where one of the numerical challenges is the
summation of electrostatic potentials of a large number of nuclei. The 3D
grid-based tensor method for calculation of a potential sum on a lattice manifests the linear in computational work, ,
instead of the usual scaling by the Ewald-type approaches
- âŠ