Search

QR decomposition is widely used for solving the least squares problem. However, existing materials about it may be too abstract for non-mathematicians, especially STEM students, and/or require serious background in linear algebra. The paper describes theoretical background and examples of GNU Octave compatible MATLAB scripts that give relatively simple but complete explanations about how to use QR decomposition for the least squares problem solution. Only basic knowledge of linear algebra and calculus are required. Both Givens rotations and Householder reflections usage for the linear least squares problem were considered. It was shown that the algorithm based on Givens rotations is even easier to program than explicit formation of the normal equations with subsequent usage of Gaussian elimination.

Let k 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function on a graph G is a function f: V (G) ! f1; 1; 2g such that P u2N(v) f(u) ≥ k for every v 2 V (G), where N(v) is the neighborhood of v, and each vertex u with f(u) = 1 is adjacent to a vertex v with f(v) = 2 or to two vertices w and z with f(w) = f(z) = 1. A set ff1; f2;: ::; fdg of distinct signed total Italian k-dominating functions on G with the property that Pd i=1 fi(v) ≤ k for each v 2 V (G), is called a signed total Italian k-dominating family (of functions) on G. The maximum number of functions in a signed total Italian k-dominating family on G is the signed total Italian k-domatic number of G, denoted by dk stI (G). In this paper we initiate the study of signed total Italian k-domatic numbers in graphs, and we present sharp bounds for dk stI (G). In addition, we determine the signed total Italian k-domatic number of some graphs. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to every other node in the network. The gossiping problem consists in finding the minimum running time (makespan) of a gossiping protocol and algorithms that attain this makespan. We focus on the case where the transmission network is a ring network. We consider synchronous protocols where it takes one unit of time (step) to transmit a unit-length message. During one step, a node receives at most one message only through one of its two neighbors. We also suppose that, during one step, a node cannot be both a sender and a receiver (half duplex model). Moreover communication is subject to interference constraints. We use a primary node interference model where, if a node receives a message from one of its neighbors, its other neighbor cannot send at the same time. With these assumptions we completely solve the problem for ring networks. We first show lower bounds and then give gossiping algorithms which meet these lower bounds and so are optimal. The number of rounds depends on the congruences of n modulo 12. [ABSTRACT FROM AUTHOR]

The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We establish some of the foundations of computational spectral theory through the Solvability Complexity Index (SCI) hierarchy, an approach closely related to Smale’s program on the foundations of computational mathematics and McMullen’s results on polynomial root finding with rational maps. Infinite-dimensional problems yield an intricate infinite classification theory, determining which spectral problems can be solved and with what types of algorithms. We provide answers to many longstanding open questions on the existence of algorithms. For example, we show that spectra can be computed, with error control, from point sampling operator coefficients for large classes of partial differential operators on unbounded domains. Further results include: computing spectra of (possibly unbounded) operators on graphs and separable Hilbert spaces with error control; determining if the spectrum intersects a compact set; the computational spectral gap problem and computing spectral classifications at the bottom of the spectrum; and computing discrete spectra, multiplicities, eigenspaces and determining if the discrete spectrum is non-empty. Moreover, the positive results with error control can be used in computer-assisted proofs. In contrast, the negative results preclude computer-assisted proofs for classes of operators as a whole. Our proofs are constructive, yielding a library of new algorithms and techniques that handle problems that before were out of reach. We demonstrate these algorithms on challenging problems, giving concrete examples of the failure of traditional approaches (e.g., “spectral pollution”) compared to the introduced techniques. [ABSTRACT FROM AUTHOR]

Motivated by several applications, we investigate the well-posedness of a switched system composed by a system of linear hyperbolic balance laws and by a system of linear algebraic differential equations. This setting includes networks and looped systems of hyperbolic balance laws. The obtained results are globally in time, provided that the inputs have finite (but not necessarily small) total variation. [ABSTRACT FROM AUTHOR]

Anzai skew-products are shown to be uniquely ergodic with respect to the fixed-point subalgebra if and only if there is a unique conditional expectation onto such a subalgebra which is invariant under the dynamics. For the particular case of skew-products, this solves a question raised by B. Abadie and K. Dykema in the wider context of C ∗ -dynamical systems. [ABSTRACT FROM AUTHOR]

We work on a Galton-Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the n-th level of the tree, as n goes to infinity, by a mostly analytic method. It turns out the order of magnitude of the expectation of this conductance can be less than 1=n (in contrast with the results of Addario-Berry-Broutin-Lugosi and Chen-Hu-Lin), depending on the value of the second zero of the characteristic function associated to the model. We also prove the almost sure (and in Lp for some p > 1) convergence of this conductance divided by its expectation towards the limit of the additive martingale. [ABSTRACT FROM AUTHOR]

Copyright of Cahiers de Topologie et Geometrie Differentielle Categoriques is the property of Andree C. EHRESMANN and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Given input-output pairs of an elliptic partial differential equation (PDE) in three dimensions, we derive the first theoretically rigorous scheme for learning the associated Green's function G. By exploiting the hierarchical low-rank structure of G, we show that one can construct an approximant to G that converges almost surely and achieves a relative error of [Formula omitted] using at most [Formula omitted] input-output training pairs with high probability, for any [Formula omitted]. The quantity [Formula omitted] characterizes the quality of the training dataset. Along the way, we extend the randomized singular value decomposition algorithm for learning matrices to Hilbert-Schmidt operators and characterize the quality of covariance kernels for PDE learning., Author(s): Nicolas Boullé [sup.1], Alex Townsend [sup.2] Author Affiliations: (1) grid.4991.5, 0000 0004 1936 8948, Mathematical Institute, University of Oxford, , OX2 6GG, Oxford, UK (2) grid.5386.8, 000000041936877X, Department of [...]

Sparse interpolation refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now the basis of exponential functions. Beyond the multivariate Chebyshev polynomial obtained as tensor products of univariate Chebyshev polynomials, the theory of root systems allows to define a variety of generalized multivariate Chebyshev polynomials that have connections to topics such as Fourier analysis and representations of Lie algebras. We present a deterministic algorithm to recover a function that is the linear combination of at most r such polynomials from the knowledge of r and an explicitly bounded number of evaluations of this function., Author(s): Evelyne Hubert [sup.1], Michael F. Singer [sup.2] Author Affiliations: (1) INRIA Méditerranée, , 06902, Sophia Antipolis, France (2) grid.40803.3f, 0000 0001 2173 6074, Department of Mathematics, North Carolina State [...]