Results 201 to 210 of about 4,991,356 (250)

Unbounded Positive Definite Functions

open access: yesCanadian Journal of Mathematics, 1969
Let G be an abelian group, written additively. A complexvalued function ƒ, defined on G, is said to be positive definite if the inequality1holds for every choice of complex numbers C1, …, cn and S1, …, sn in G. It follows directly from (1) that every positive definite function is bounded. Weil (9, p.
James Stewart
openaire   +3 more sources

Extrapolated positive definite and positive semi-definite splitting methods for solving non-Hermitian positive definite linear systems

Applications of Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shokrpour, Raheleh, Ebadi, Ghodrat
openaire   +2 more sources

On Different Definitions of Positive Definiteness

Mathematische Nachrichten, 1991
Let the function \(T^*\) be defined by \(T^*(a)=T(a^{-1})^*\) for a function \(T\) of a group \(G\) into a Hilbert space. The authors show that the commutativity of \(G\) is equivalent to each of the conditions below: (1) \(T^*\) is positive definite for every representation \(T\) of \(G\) in Hilbert space.
Friedrich, J., Klotz, L.
openaire   +1 more source

On the Measurability of Positive Definite and Conditionally Positive Definite Functions

Mathematische Nachrichten, 1986
Let f be a positive definite function on a locally compact abelian group G. In this paper we show that measurability of f on an open neighbourhood of the zero implies measurability of f on G. The same result holds for conditionally positive definite functions.
openaire   +1 more source

Verification of Positive Definiteness

BIT Numerical Mathematics, 2006
An efficient numerical criterion to verify positive definiteness of a symmetric or Hermitian matrix is presented. The criterion is based on standard IEEE 754 floating-point arithmetic with rounding to nearest. It implements a single floating-point Cholesky decomposition and improves a known result.
openaire   +1 more source

Positive Powers of Positive Positive Definite Matrices

Canadian Journal of Mathematics, 1996
AbstractLet C be an n x n positive definite matrix. If C ≥ 0 in the sense that Cij ≥ 0 and if p > n — 2, then Cp ≥ 0. This implies the following "positive minorant property" for the norms ‖A‖p = [tr(A*A)p/2]1/P. Let 2 < p ≠ 4, 6, … . Then 0 ≤ A ≤ B => ‖A‖p ≥ ‖B‖P if and only if n < p/2 + 1.
openaire   +1 more source

On Dugundji's Notion of Positive Definiteness

Proceedings of the American Mathematical Society, 1974
Dugundji’s notion of positive definiteness is generalized to nonnegative real-valued functions on a uniform space. Its relations with completeness and various notions of compactness are investigated. For an arbitrary uniform space X
openaire   +1 more source

Positive Definite Toeplitz Completions

Journal of the London Mathematical Society, 1999
Consider a partially prescribed Toeplitz matrix \(T\), that is, a Toeplitz matrix in which some diagonals are specified, while other are unspecified and may thus be treated as free variables. A completion of \(T\) is an assignment of values to the unspecified diagonals. The pattern \(P(T)\) of a partially defined Hermitian Toeplitz matrix is the set of
Johnson, Charles R.   +2 more
openaire   +1 more source

Addendum to the Paper „On the Measurability of Positive Definite and Conditionally Positive Definite Functions”︁

Mathematische Nachrichten, 1987
The aim of this note is to simplify the proof of Theorem 1 [(*)\ ibid. 125, 239-242 (1986; Zbl 0605.43004)] and to extend the results of (*) to arbitrary locally compact groups.
openaire   +2 more sources

Positive Definite Rational Kernels

2003
Kernel methods are widely used in statistical learning techniques. We recently introduced a general kernel framework based on weighted transducers or rational relations, rational kernels, to extend kernel methods to the analysis of variable-length sequences or more generally weighted automata.
Corinna Cortes   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy