Determination of a jump by Fourier and Fourier-Chebyshev series

Authors

  • M. Avdispahic University of Sarajevo‎, ‎Deaprtment of Mathematics‎, ‎Zmaja od Bosne 33-35‎, ‎71 000 Sarajevo‎, ‎Bosnia and Herzegovina.
  • Z. Sabanac University of Sarajevo‎, ‎Deaprtment of Mathematics‎, ‎Zmaja od Bosne 33-35‎, ‎71 000 Sarajevo‎, ‎Bosnia and Herzegovina.
Abstract:

‎By observing the equivalence of assertions on determining the jump of a‎ ‎function by its differentiated or integrated Fourier series‎, ‎we generalize a‎ ‎previous result of Kvernadze‎, ‎Hagstrom and Shapiro to the whole class of‎ ‎functions of harmonic bounded variation‎. ‎This is achieved without the finiteness assumption on‎ ‎the number of discontinuities‎. ‎Two results on determination of jump‎ ‎discontinuities by means of the tails of integrated Fourier-Chebyshev series are also derived.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Discrete–time Fourier Series and Fourier Transforms

We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...

full text

Discrete–time Fourier Series and Fourier Transforms

We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...

full text

Fourier Series

for some fixed τ , which is called the period of f . Though function approximation using orthogonal polynomials is very convenient, there is only one kind of periodic polynomial, that is, a constant. So, polynomials are not good for approximating periodic functions. In this case, trigonometric functions are quite useful. A large class of important computational problems falls under the category...

full text

Fourier Series

Here are some facts about Fourier Series — useful for pde and elsewhere. Proofs of Lemmas are easy exercises, and not given. On the other hand, proofs of LEMMAS are harder; their proofs are indicated, or a reference is given.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 43  issue 7

pages  2307- 2321

publication date 2017-12-30

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023