scholarly journals Parameter estimation and signal reconstruction

CALCOLO ◽  
2021 ◽  
Vol 58 (3) ◽  
Author(s):  
Michael-Ralf Skrzipek

AbstractIn frequency analysis an often appearing problem is the reconstruction of a signal from given samples. Since the samples are usually noised, pure interpolating approaches are not recommended and appropriate approximation methods are more suitable as they can be interpreted as a kind of denoising. Two approaches are widely used. One uses the reflection coefficients of a finite sequence of Szegő polynomials and the other one the zeros of the so called Prony polynomial. We show that both approaches are closely related. As a kind of inverse problem, it’s not surprising that they have in common that both methods depend very sensitive on sampling errors. We use known properties of the signal to estimate the positions of the zeros of the corresponding Szegő- or Prony-like polynomials and construct adaptive algorithms to calculate these ones. Hereby, we get the corresponding parameters in the exponential parts of the signal, too. Then, the coefficients of the signal (as a linear combination of such exponential functions) can be obtained from a system of linear equations by minimizing the residuals with respect to a suitable norm as a kind of denoising.

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.


1924 ◽  
Vol 22 (3) ◽  
pp. 282-286
Author(s):  
E. C. Titchmarsh

I have collected in the present note some theorems regarding the solution of a certain system of linear equations with an infinity of unknowns. The general form of the equations isthe numbers a1, a2, … c1, c2, … being given. Equations of this type are of course well known; but in studying them it is generally assumed that the series depend for convergence on the convergence-exponent of the sequences involved, e.g. that and are convergent. No assumptions of this kind are made here, and in fact the series need not be absolutely convergent. On the other hand rather special assumptions are made with regard to the monotonic character of the sequences an and cn.


2020 ◽  
Vol 12 (1) ◽  
pp. 60-71
Author(s):  
Firew Hailu ◽  
Genanew Gofe Gonfa ◽  
Hailu Muleta Chemeda

In this paper, a second degree generalized successive over relaxation iterative method for solving system of linear equations based on the decomposition  A= Dm+Lm+Um  is presented and the convergence properties of the proposed method are discussed. Two numerical examples are considered to show the efficiency of the proposed method. The results presented in tables show that the Second Degree Generalized Successive Over Relaxation Iterative method is more efficient than the other methods considered based on number of iterations, computational running time and accuracy. Keywords: Second Degree, Generalized Gauss Seidel, Successive over relaxation, Convergence.


2018 ◽  
Vol 102 (554) ◽  
pp. 203-209
Author(s):  
Stanley R. Huddy ◽  
Michael A. Jones

If no two of three non-collinear points share the same x-coordinate, then the parabola y = a2x2 + a1x + a0 through the points is easily found by solving a system of linear equations. That is but one of an infinite number of parabolas through the three points. How does one find the other parabolas? In this note, we find all parabolas through any three non-collinear points by reducing the problem to finding the equation of a parabola by using rotations.The parabola y = a2x2 + a1x + a0 has an axis of symmetry parallel to the y-axis. Other parabolas have an axis of symmetry that is parallel to some line y = mx. We focus on the angle θ that the axis of symmetry makes with the y-axis, as in Figure 1, so that tanθ = 1/m. To find the parabola associated with θ that goes through three non-collinear points, we rotate the three points counterclockwise by θ, find the equation of the parabola, and then rotate the parabola (and the three points) counterclockwise back by −θ so that the parabola goes through the original points.


Author(s):  
David Ek ◽  
Anders Forsgren

AbstractThe focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton’s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. We propose partial and full approximate solutions to the Newton systems. The specific approximate solution depends on estimates of the active and inactive constraints at the solution. These sets are at each iteration estimated by basic heuristics. The partial approximate solutions are computationally inexpensive, whereas a system of linear equations needs to be solved for the full approximate solution. The size of the system is determined by the estimate of the inactive constraints at the solution. In addition, we motivate and suggest two Newton-like approaches which are based on an intermediate step that consists of the partial approximate solutions. The theoretical setting is introduced and asymptotic error bounds are given. We also give numerical results to investigate the performance of the approximate solutions within and beyond the theoretical framework.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
A. Khalid ◽  
M. N. Naeem ◽  
P. Agarwal ◽  
A. Ghaffar ◽  
Z. Ullah ◽  
...  

AbstractIn the current paper, authors proposed a computational model based on the cubic B-spline method to solve linear 6th order BVPs arising in astrophysics. The prescribed method transforms the boundary problem to a system of linear equations. The algorithm we are going to develop in this paper is not only simply the approximation solution of the 6th order BVPs using cubic B-spline, but it also describes the estimated derivatives of 1st order to 6th order of the analytic solution at the same time. This novel technique has lesser computational cost than numerous other techniques and is second order convergent. To show the efficiency of the proposed method, four numerical examples have been tested. The results are described using error tables and graphs and are compared with the results existing in the literature.


Sign in / Sign up

Export Citation Format

Share Document