A descent algorithm for $\varepsilon $ - approximation of continuous functions with values in unitary space

M. Janc

Displaying similar documents to “A descent algorithm for $ε$ - approximation of continuous functions with values in unitary space”

On the weighted Euclidean matching problem in $ℝ^{d}$

Birgit Anthes, Ludger Rüschendorf (2001)

Applicationes Mathematicae

Similarity:

A partitioning algorithm for the Euclidean matching problem in $ℝ^{d}$ is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton and Terada (1982) for the traveling salesman problem. The algorithm runs in expected time $n {(l o g n)}^{p - 1}$ and approximates the optimal matching in the probabilistic sense.

The general methods of finding the sum $S_{n}$ for all kinds of series

K. Orlov (1981)

Matematički Vesnik

Similarity:

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan

Similarity:

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$ - $s$ transformation and $Q R$ -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

Uniform convergence of the greedy algorithm with respect to the Walsh system

Martin Grigoryan (2010)

Studia Mathematica

Similarity:

For any 0 < ϵ < 1, p ≥ 1 and each function $f \in L^{p} [0, 1]$ one can find a function $g \in L^{\infty} [0, 1)$ with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence $| c_{k} (g) | : k \in s p e c (g)$ is decreasing, where $c_{k} (g)$ is the sequence of Fourier coefficients of g with respect to the Walsh system.

On the Kaczmarz algorithm of approximation in infinite-dimensional spaces

Stanisław Kwapień, Jan Mycielski (2001)

Studia Mathematica

Similarity:

The Kaczmarz algorithm of successive projections suggests the following concept. A sequence $(e_{k})$ of unit vectors in a Hilbert space is said to be effective if for each vector x in the space the sequence (xₙ) converges to x where (xₙ) is defined inductively: x₀ = 0 and $x ₙ = x_{n - 1} + α ₙ e ₙ$ , where $α ₙ = ⟨ x - x_{n - 1}, e ₙ ⟩$ . We prove the effectivity of some sequences in Hilbert spaces. We generalize the concept of effectivity to sequences of vectors in Banach spaces and we prove some results for this more general concept.

Seasonal time-series imputation of gap missing algorithm (STIGMA)

Eduardo Rangel-Heras, Pavel Zuniga, Alma Y. Alanis, Esteban A. Hernandez-Vargas, Oscar D. Sanchez (2023)

Kybernetika

Similarity:

This work presents a new approach for the imputation of missing data in weather time-series from a seasonal pattern; the seasonal time-series imputation of gap missing algorithm (STIGMA). The algorithm takes advantage from a seasonal pattern for the imputation of unknown data by averaging available data. We test the algorithm using data measured every $10$ minutes over a period of $365$ days during the year 2010; the variables include global irradiance, diffuse irradiance, ultraviolet irradiance,...

Implicitization of Parametric Hypersurfaces via Points

Ferruccio Orecchia, Isabella Ramella (2018)

Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche

Similarity:

Given a parametric polynomial representation of an algebraic hypersurface $\mathbf{S}$ in the projective space we give a new algorithm for finding the implicit cartesian equation of $\mathbf{S}$ .The algorithm is based on finding a suitable finite number of points on $\mathbf{S}$ and computing, by linear algebra, the equation of the hypersurface of least degree that passes through the points. In particular the algorithm works for plane curves and surfaces in the ordinary three-dimensional space. Using C++ the algorithm...

Structure theory for the group algebra of the symmetric group, with applications to polynomial identities for the octonions

Murray R. Bremner, Sara Madariaga, Luiz A. Peresi (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This is a survey paper on applications of the representation theory of the symmetric group to the theory of polynomial identities for associative and nonassociative algebras. In §1, we present a detailed review (with complete proofs) of the classical structure theory of the group algebra $𝔽 S_{n}$ of the symmetric group $S_{n}$ over a field $𝔽$ of characteristic 0 (or $p > n$ ). The goal is to obtain a constructive version of the isomorphism $ψ : ⨁_{λ} M_{d_{λ}} (𝔽) ⟶ 𝔽 S_{n}$ where $λ$ is a partition of $n$ and $d_{λ}$ counts the standard tableaux...

Displaying similar documents to “A descent algorithm for ε - approximation of continuous functions with values in unitary space”

Displaying similar documents to “A descent algorithm for $ε$ - approximation of continuous functions with values in unitary space”