Results 1  10
of
47,178
Asymptotics for JacobiSobolev orthogonal polynomials associated with noncoherent pairs of measures∗
"... Abstract: Inner products of the type 〈f, g〉S = 〈f, g〉ψ0 + 〈f ′, g′〉ψ1, where one of the measures ψ0 or ψ1 is the measure associated with the Jacobi polynomials, are usually referred to as JacobiSobolev inner products. This paper deals with some asymptotic relations for the orthogonal polynomials ..."
Abstract
 Add to MetaCart
Abstract: Inner products of the type 〈f, g〉S = 〈f, g〉ψ0 + 〈f ′, g′〉ψ1, where one of the measures ψ0 or ψ1 is the measure associated with the Jacobi polynomials, are usually referred to as JacobiSobolev inner products. This paper deals with some asymptotic relations for the orthogonal polynomials
JacobiSobolev expansions
, 2012
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
On Fourier series of JacobiSobolev orthogonal polynomials
 J. of Inequal. and Appl
"... Let J.l be the Jacobi measure on the interval [I, I] and introduce the discrete Sobolevtype inner product (j,g) = Lf(X)g(X)dJ.l(X) + Mf(c)g(c) + Nf'(c)g'(c) where c E (1,00) and M, N are non negative constants such that M + N> O. The main purpose of this paper is to study the behavio ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Let J.l be the Jacobi measure on the interval [I, I] and introduce the discrete Sobolevtype inner product (j,g) = Lf(X)g(X)dJ.l(X) + Mf(c)g(c) + Nf'(c)g'(c) where c E (1,00) and M, N are non negative constants such that M + N> O. The main purpose of this paper is to study
ESTIMATES FOR JACOBISOBOLEV TYPE ORTHOGONAL POLYNOMIALS by
"... Abstract. Let the Sobolevtype inner product 〈f, g 〉 = R fgdµ0 + R f ′g′dµ1 with µ0 = w +Mδc, µ1 = Nδc where w is the Jacobi weight, c is either 1 or −1 and M,N ≥ 0. We obtain estimates and asymptotic properties on [−1, 1] for the polynomials orthonormal with respect to 〈.,. 〉 and their kernels. We ..."
Abstract
 Add to MetaCart
Abstract. Let the Sobolevtype inner product 〈f, g 〉 = R fgdµ0 + R f ′g′dµ1 with µ0 = w +Mδc, µ1 = Nδc where w is the Jacobi weight, c is either 1 or −1 and M,N ≥ 0. We obtain estimates and asymptotic properties on [−1, 1] for the polynomials orthonormal with respect to 〈.,. 〉 and their kernels. We
Taylor & Francis Group On Fourier Series of JacobiSobolev Orthogonal Polynomials
, 2000
"... Let It be the Jacobi measure on the intervat [1, 1] and introduce the discrete Sobolevtype inner product (f g) f(x)g(x)dlt(x) + Mf(c)g(c) + Nf’(c)g’(c)1 where c E (1, cx) and M, N are non negative constants such that M +N> 0. The main purpose of this paper is to study the behaviour of the Four ..."
Abstract
 Add to MetaCart
Let It be the Jacobi measure on the intervat [1, 1] and introduce the discrete Sobolevtype inner product (f g) f(x)g(x)dlt(x) + Mf(c)g(c) + Nf’(c)g’(c)1 where c E (1, cx) and M, N are non negative constants such that M +N> 0. The main purpose of this paper is to study the behaviour
Research Article On the Pollard decomposition method applied to some Jacobi{Sobolev expansions
"... Abstract: Let fq(;)n gn0 be the sequence of polynomials orthonormal with respect to the Sobolev inner product ⟨f; g⟩S:= ..."
Abstract
 Add to MetaCart
Abstract: Let fq(;)n gn0 be the sequence of polynomials orthonormal with respect to the Sobolev inner product ⟨f; g⟩S:=
Factoring wavelet transforms into lifting steps
 J. Fourier Anal. Appl
, 1998
"... ABSTRACT. This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This dec ..."
Abstract

Cited by 573 (8 self)
 Add to MetaCart
in the biorthogonal, i.e, nonunitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a waveletlike transform that maps integers to integers. 1.
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear
The StructureMapping Engine: Algorithm and Examples
 Artificial Intelligence
, 1989
"... This paper describes the StructureMapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structuremapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its flexibili ..."
Abstract

Cited by 512 (115 self)
 Add to MetaCart
, and demonstrate that most of the steps are polynomial, typically bounded by O (N 2 ). Next we demonstrate some examples of its operation taken from our cognitive simulation studies and work in machine learning. Finally, we compare SME to other analogy programs and discuss several areas for future work. This paper
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
progressed also to the study of socalled stationary points, critical points, and other indications of singularity that a point might have relative to its neighbors, especially in association with existence theorems for differential equations.
Results 1  10
of
47,178