The general methods of finding the sum for all kinds of series
K. Orlov (1981)
Matematički Vesnik
Similarity:
K. Orlov (1981)
Matematički Vesnik
Similarity:
M. Janc (1982)
Matematički Vesnik
Similarity:
Rudolf Scitovski, Kristian Sabo (2019)
Applications of Mathematics
Similarity:
We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse is viewed as a Mahalanobis circle with center , radius , and some positive definite matrix . A very efficient method for solving this problem is proposed. The method uses a modification of the -means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers...
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 - transformation and -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.
Martin Grigoryan (2010)
Studia Mathematica
Similarity:
For any 0 < ϵ < 1, p ≥ 1 and each function one can find a function 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 is decreasing, where is the sequence of Fourier coefficients of g with respect to the Walsh system.
Jinyao Ma, Haibin Zhang, Shanshan Yang, Jiaojiao Jiang (2023)
Applications of Mathematics
Similarity:
We provide a theoretical study of the iterative hard thresholding with partially known support set (IHT-PKS) algorithm when used to solve the compressed sensing recovery problem. Recent work has shown that IHT-PKS performs better than the traditional IHT in reconstructing sparse or compressible signals. However, less work has been done on analyzing the performance guarantees of IHT-PKS. In this paper, we improve the current RIP-based bound of IHT-PKS algorithm from to , where is...
Ferruccio Orecchia, Isabella Ramella (2018)
Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche
Similarity:
Given a parametric polynomial representation of an algebraic hypersurface in the projective space we give a new algorithm for finding the implicit cartesian equation of .The algorithm is based on finding a suitable finite number of points on 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...
Erin Claire Carson (2020)
Applications of Mathematics
Similarity:
The adaptive -step CG algorithm is a solver for sparse symmetric positive definite linear systems designed to reduce the synchronization cost per iteration while still achieving a user-specified accuracy requirement. In this work, we improve the adaptive -step conjugate gradient algorithm by the use of iteratively updated estimates of the largest and smallest Ritz values, which give approximations of the largest and smallest eigenvalues of , using a technique due to G. Meurant and...
Chafia Daili, Mohamed Achache (2022)
Applications of Mathematics
Similarity:
We propose a feasible primal-dual path-following interior-point algorithm for semidefinite least squares problems (SDLS). At each iteration, the algorithm uses only full Nesterov-Todd steps with the advantage that no line search is required. Under new appropriate choices of the parameter which defines the size of the neighborhood of the central-path and of the parameter which determines the rate of decrease of the barrier parameter, we show that the proposed algorithm is well defined...
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 minutes over a period of days during the year 2010; the variables include global irradiance, diffuse irradiance, ultraviolet irradiance,...
Stanisław Kwapień, Jan Mycielski (2001)
Studia Mathematica
Similarity:
The Kaczmarz algorithm of successive projections suggests the following concept. A sequence 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 , where . 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.