Displaying similar documents to “A numerical method of matrix spectral factorization”

On Nonadaptive Search Problem

Kolev, Emil (2003)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 91A46, 91A35. We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2^n}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonadaptive search with n questions finds x. We continue our investigation from [4] and solve the last remaining case n = 2^k , k ≥ 2. ...

Métodos para la actualización de los factores de Q y R de una matriz.

Laureano F. Escudero (1984)

Trabajos de Estadística e Investigación Operativa

Similarity:

Recientemente se han propuesto varios métodos para modificar los factores Q y R de una matriz una vez que se ha eliminado (o añadido) una fila o una columna. Normalmente la descripción de estos métodos se efectúa en el contexto de una determinada aplicación; quizá sea ésta la causa de su escasa difusión.

A footnote to the Poincaré complete reducibility theorem.

Henrik H. Martens (1992)

Publicacions Matemàtiques

Similarity:

Poincaré's work on the reduction of Abelian integrals contains implicitly an algorithm for the expression of a theta function as a sum of products of theta functions of fewer variables in the presence of reduction. The aim of this paper is to give explicit formulations and reasonably complete proofs of Poincaré's results.