Iskanje po repozitoriju

A+ | A- | | SLO | ENG

Povzetek: We extend the concept of a G-Drazin inverse from the set $M_n$ of all $n \times n$ complex matrices to the set ${\cal R}^D$ of all Drazin invertible elements in a ring ${\cal R}$ with identity. We also generalize a partial order induced by G-Drazin inverses from $M_n$ to the set of all regular elements in ${\cal R}^D$, study its properties, compare it to known partial orders, and generalize some known results.
Ključne besede: Drazin inverse, core-nilpotent decomposition, partial order, annihilator, ring
Objavljeno v DiRROS: 05.09.2024; Ogledov: 71; Prenosov: 38
Celotno besedilo (516,17 KB)
Gradivo ima več datotek! Več...

Povzetek: By interpreting planar polynomial curves as complex-valued functions of a real parameter, an inner product, norm, metric function, and the notion of orthogonality may be defined for such curves. This approach is applied to the complex pre-image polynomials that generate planar Pythagorean-hodograph (PH) curves, to facilitate the implementation of bounded modifications of them that preserve their PH nature. The problems of bounded modifications under the constraint of fixed curve end points and end tangent directions, and of increasing the arc length of a PH curve by a prescribed amount, are also addressed.
Ključne besede: complex polynomials, inner product, norm, metric, Pythagorean-hodograph curves, bounded modification
Objavljeno v DiRROS: 04.09.2024; Ogledov: 63; Prenosov: 657
Celotno besedilo (3,60 MB)
Gradivo ima več datotek! Več...

Povzetek: This paper introduces a method to detect each geometrically significant loop that is a geodesic circle (an isometric embedding of $S^1$) and a bottleneck loop (meaning that each of its perturbations increases the length) in a geodesic space using persistent homology. Under fairly mild conditions, we show that such a loop either terminates a 1- dimensional homology class or gives rise to a 2-dimensional homology class in persistent homology. The main tool in this detection technique are selective Rips complexes, new custom made complexes that function as an appropriate combinatorial lens for persistent homology to detect the above mentioned loops. The main argument is based on a new concept of a local winding number, which turns out to be an invariant of certain homology classes.
Ključne besede: simple closed geodesic, Rips complex, persistent homology, local winding number
Objavljeno v DiRROS: 26.08.2024; Ogledov: 119; Prenosov: 64
Celotno besedilo (906,54 KB)
Gradivo ima več datotek! Več...

Povzetek: The numerical solution of the generalized eigenvalue problem for a singular matrix pencil is challenging due to the discontinuity of its eigenvalues. Classically, such problems are addressed by first extracting the regular part through the staircase form and then applying a standard solver, such as the QZ algorithm, to that regular part. Recently, several novel approaches have been proposed to transform the singular pencil into a regular pencil by relatively simple randomized modifications. In this work, we analyze three such methods by Hochstenbach, Mehl, and Plestenjak that modify, project, or augment the pencil using random matrices. All three methods rely on the normal rank and do not alter the finite eigenvalues of the original pencil. We show that the eigenvalue condition numbers of the transformed pencils are unlikely to be much larger than the ▫$\delta$▫-weak eigenvalue condition numbers, introduced by Lotz and Noferini, of the original pencil. This not only indicates favorable numerical stability but also reconfirms that these condition numbers are a reliable criterion for detecting simple finite eigenvalues. We also provide evidence that, from a numerical stability perspective, the use of complex instead of real random matrices is preferable even for real singular matrix pencils and real eigenvalues. As a side result, we provide sharp left tail bounds for a product of two independent random variables distributed with the generalized beta distribution of the first kind or Kumaraswamy distribution.
Ključne besede: singular pencil, singular generalized eigenvalue problem, eigenvalue condition number, randomized numerical method, random matrices
Objavljeno v DiRROS: 26.08.2024; Ogledov: 125; Prenosov: 65
Celotno besedilo (659,18 KB)
Gradivo ima več datotek! Več...

Povzetek: In this paper, we study the bivariate truncated moment problem (TMP) on curves of the form $y = q(x), q(x) \in \mathbb{R} [x], \deg q ≥ 3$ and $yx^\ell = 1, \ell \in \mathbb{N}$ \ $\{1\}$. For even degree sequences, the solution based on the size of moment matrix extensions was first given by Fialkow [Fialkow L. Solution of the truncated moment problem with variety $y = x^3$. Trans Amer Math Soc. 2011;363:3133–3165.] using the truncated Riesz–Haviland theorem [Curto R, Fialkow L. An analogue of the Riesz–Haviland theorem for the truncated moment problem. J Funct Anal. 2008;255:2709–2731.] and a sum-of-squares representations for polynomials, strictly positive on such curves [Fialkow L. Solution of the truncated moment problem with variety $y = x^3$. Trans Amer Math Soc. 2011;363:3133–3165.; Stochel J. Solving the truncated moment problem solves the moment problem. Glasgow J Math. 2001;43:335–341.]. Namely, the upper bound on this size is quadratic in the degrees of the sequence and the polynomial determining a curve. We use a reduction to the univariate setting technique, introduced in [Zalar A. The truncated Hamburger moment problem with gaps in the index set. Integral Equ Oper Theory. 2021;93:36.doi: 10.1007/s00020-021-02628-6.; Zalar A. The truncated moment problem on the union of parallel lines. Linear Algebra Appl. 2022;649:186–239. doi.org/10.1016/j.laa.2022.05.008.; Zalar A. The strong truncated Hamburger moment problem with and without gaps. J Math Anal Appl. 2022;516:126563. doi: 10.1016/j.jmaa.2022. 126563.], and improve Fialkow’s bound to $\deg q − 1$ (resp. $\ell + 1$) for curves $y = q(x)$ (resp. $yx^\ell = 1$). This in turn gives analogous improvements of the degrees in the sum-of-squares representations referred to above. Moreover, we get the upper bounds on the number of atoms in the minimal representing measure, which are $k \deg q$ (resp. $k(\ell+ 1)$) for curves $y = q(x)$ (resp. $yx^\ell = 1$) for even degree sequences, while for odd ones they are $k \deg q − \bigl \lceil \frac{\deg q}{2} \bigr \rceil$ (resp. $k(\ell + 1) − \bigl \lfloor \frac{\ell}{2} \bigr \rfloor + 1$) for curves $y = q(x)$ (resp. $yx^\ell = 1$). In the even case, these are counterparts to the result by Riener and Schweighofer [Riener C, Schweighofer M. Optimization approaches to quadrature:a new characterization of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions. J Complex. 2018;45:22–54., Corollary 7.8], which gives the same bound for odd degree sequences on all plane curves. In the odd case, their bound is slightly improved on the curves we study. Further on, we give another solution to the TMP on the curves studied based on the feasibility of a linear matrix inequality, corresponding to the univariate sequence obtained, and finally we solve concretely odd degree cases to the TMP on curves $y = x^\ell, \ell = 2, 3,$ and add a new solvability condition to the even degree case on the curve $y = x^2$.
Ključne besede: truncated moment problems, K-moment problems, K-representing measure, minimal measure, moment matrix extensions, positivstellensatz, linear matrix inequality
Objavljeno v DiRROS: 25.07.2024; Ogledov: 207; Prenosov: 171
Celotno besedilo (3,50 MB)
Gradivo ima več datotek! Več...