It is a slide for a talk given in the conference "ApplMath18" (9th Conference on Applied Mathematics and Scientific Computing, 17-20 September, 2018, Solaris, Sibenik, Croatia). We propose a numerical method of analytic continuation using continued fraction. From theoretical analysis and numerical examples, our method is so effective that it shows exponential convergence. We also apply our method to the computation of Fourier transforms.
This document discusses how humans perceive visual stimuli and images. It covers topics like the anatomy of the eye, luminance, contrast, color perception, and models of visual sensitivity. Some key points:
- The retina detects light and contains photoreceptors like rods and cones that are sensitive to different wavelengths. The fovea provides high spatial resolution.
- Luminance describes the achromatic component of an image and is proportional to energy. Contrast is a better measure of visual differences than linear changes in luminance.
- Weber's law and power law transformations model how visual sensitivity depends on background luminance in a perceptually uniform way.
- The contrast sensitivity function measures sensitivity to spatial frequencies and
1) Sparse signal processing techniques aim to represent signals using a small number of nonzero coefficients.
2) Compressive sensing (CS) allows acquiring signals at a rate below Nyquist by taking linear measurements using an incoherent sensing matrix.
3) CS reconstruction recovers the original sparse signal by imposing sparsity constraints during recovery from the undersampled measurements. The number of measurements required depends on the sparsity and mutual incoherence between the sensing and sparsity bases.
Neural Radiance Fields (NeRF) represents scenes as neural radiance fields that can be used for novel view synthesis. NeRF learns a continuous radiance field from a sparse set of input views using a multi-layer perceptron that maps 5D coordinates to RGB color and density values. It uses volumetric rendering to integrate these values along camera rays and optimizes the network via differentiable rendering and a reconstruction loss. NeRF produces high-fidelity novel views and has inspired extensions like handling dynamic scenes and reconstructing scenes from unstructured internet photos.
Microwave photonics is the study of high-speed photonic devices operating at microwave or millimeter wave frequencies and their use in microwave or photonic systems. This paper provides an overview of this multidisciplinary field, including typical investigations such as signal generation, processing, and transmission via optical links. It discusses key components such as traveling wave electroabsorption modulators and detectors, and how microwave technologies can improve photonic bandwidth. Broad applications are presented, including photonic signal generation, EMC sensing, testing, hybrid fiber-coax systems, fiber-radio, and antenna remoting.
The document discusses digital image processing techniques in the frequency domain. It begins by introducing the discrete Fourier transform (DFT) of one-variable functions and how it relates to sampling a continuous function. It then extends this concept to two-dimensional functions and images. Key topics covered include the 2D DFT and its properties such as translation, rotation, and periodicity. Aliasing in images is also discussed. The document provides examples of how to compute the DFT and inverse DFT of simple images.
The document discusses elements of visual perception including the structure and function of the human eye and visual system. It describes how (1) light is focused through the cornea and lens onto the retina, where rods and cones detect the image and transmit signals to the brain, (2) the fovea provides sharp central vision while peripheral vision is supported by rods, and (3) brightness adaptation allows the eye to perceive a wide range of intensities through changes in sensitivity. Phenomena like Mach bands and simultaneous contrast demonstrate that perceived brightness depends on context rather than absolute intensity.
Paper Summary of Disentangling by Factorising (Factor-VAE)준식 최
The paper proposes Factor-VAE, which aims to learn disentangled representations in an unsupervised manner. Factor-VAE enhances disentanglement over the β-VAE by encouraging the latent distribution to be factorial (independent across dimensions) using a total correlation penalty. This penalty is optimized using a discriminator network. Experiments on various datasets show that Factor-VAE achieves better disentanglement than β-VAE, as measured by a proposed disentanglement metric, while maintaining good reconstruction quality. Latent traversals qualitatively demonstrate disentangled factors of variation.
This document discusses how humans perceive visual stimuli and images. It covers topics like the anatomy of the eye, luminance, contrast, color perception, and models of visual sensitivity. Some key points:
- The retina detects light and contains photoreceptors like rods and cones that are sensitive to different wavelengths. The fovea provides high spatial resolution.
- Luminance describes the achromatic component of an image and is proportional to energy. Contrast is a better measure of visual differences than linear changes in luminance.
- Weber's law and power law transformations model how visual sensitivity depends on background luminance in a perceptually uniform way.
- The contrast sensitivity function measures sensitivity to spatial frequencies and
1) Sparse signal processing techniques aim to represent signals using a small number of nonzero coefficients.
2) Compressive sensing (CS) allows acquiring signals at a rate below Nyquist by taking linear measurements using an incoherent sensing matrix.
3) CS reconstruction recovers the original sparse signal by imposing sparsity constraints during recovery from the undersampled measurements. The number of measurements required depends on the sparsity and mutual incoherence between the sensing and sparsity bases.
Neural Radiance Fields (NeRF) represents scenes as neural radiance fields that can be used for novel view synthesis. NeRF learns a continuous radiance field from a sparse set of input views using a multi-layer perceptron that maps 5D coordinates to RGB color and density values. It uses volumetric rendering to integrate these values along camera rays and optimizes the network via differentiable rendering and a reconstruction loss. NeRF produces high-fidelity novel views and has inspired extensions like handling dynamic scenes and reconstructing scenes from unstructured internet photos.
Microwave photonics is the study of high-speed photonic devices operating at microwave or millimeter wave frequencies and their use in microwave or photonic systems. This paper provides an overview of this multidisciplinary field, including typical investigations such as signal generation, processing, and transmission via optical links. It discusses key components such as traveling wave electroabsorption modulators and detectors, and how microwave technologies can improve photonic bandwidth. Broad applications are presented, including photonic signal generation, EMC sensing, testing, hybrid fiber-coax systems, fiber-radio, and antenna remoting.
The document discusses digital image processing techniques in the frequency domain. It begins by introducing the discrete Fourier transform (DFT) of one-variable functions and how it relates to sampling a continuous function. It then extends this concept to two-dimensional functions and images. Key topics covered include the 2D DFT and its properties such as translation, rotation, and periodicity. Aliasing in images is also discussed. The document provides examples of how to compute the DFT and inverse DFT of simple images.
The document discusses elements of visual perception including the structure and function of the human eye and visual system. It describes how (1) light is focused through the cornea and lens onto the retina, where rods and cones detect the image and transmit signals to the brain, (2) the fovea provides sharp central vision while peripheral vision is supported by rods, and (3) brightness adaptation allows the eye to perceive a wide range of intensities through changes in sensitivity. Phenomena like Mach bands and simultaneous contrast demonstrate that perceived brightness depends on context rather than absolute intensity.
Paper Summary of Disentangling by Factorising (Factor-VAE)준식 최
The paper proposes Factor-VAE, which aims to learn disentangled representations in an unsupervised manner. Factor-VAE enhances disentanglement over the β-VAE by encouraging the latent distribution to be factorial (independent across dimensions) using a total correlation penalty. This penalty is optimized using a discriminator network. Experiments on various datasets show that Factor-VAE achieves better disentanglement than β-VAE, as measured by a proposed disentanglement metric, while maintaining good reconstruction quality. Latent traversals qualitatively demonstrate disentangled factors of variation.
Numerical Fourier transform based on hyperfunction theoryHidenoriOgata
This is the PC slide of a contributed talk in the conference "ECMI2018 (The 20th European Conference on Mathematics for Industry)", 18-20 June 2018, Budapest, Hungary. In this talk, we propose a numerical method of Fourier transforms based on hyperfunction theory.
Introduction to Digital Signal Processing (DSP) - Course NotesAhmed Gad
Documentation of digital signal processing course giving an introduction to the field.
The course covers the following:
Principles of Digital Signal Processing.
Continuous, Discrete Signals and Systems.
Basic Operations on Signals
Discrete Time System Fundamentals
Discrete Time System.
Convolution
Discrete Fourier Transform.
Continuous Fourier Transform.
Fourier Transform
Discrete Fourier Transform.
Continuous Fourier Transform.
Z-Transform
Laplace Transform
Digital Filter Design
FIR Filter Design.
IIR Filter Design.
Find me on:
AFCIT
http://www.afcit.xyz
YouTube
https://www.youtube.com/channel/UCuewOYbBXH5gwhfOrQOZOdw
Google Plus
https://plus.google.com/u/0/+AhmedGadIT
SlideShare
https://www.slideshare.net/AhmedGadFCIT
LinkedIn
https://www.linkedin.com/in/ahmedfgad/
ResearchGate
https://www.researchgate.net/profile/Ahmed_Gad13
Academia
https://www.academia.edu/
Google Scholar
https://scholar.google.com.eg/citations?user=r07tjocAAAAJ&hl=en
Mendelay
https://www.mendeley.com/profiles/ahmed-gad12/
ORCID
https://orcid.org/0000-0003-1978-8574
StackOverFlow
http://stackoverflow.com/users/5426539/ahmed-gad
Twitter
https://twitter.com/ahmedfgad
Facebook
https://www.facebook.com/ahmed.f.gadd
Pinterest
https://www.pinterest.com/ahmedfgad/
DSP_FOEHU - MATLAB 04 - The Discrete Fourier Transform (DFT)Amr E. Mohamed
The document discusses the discrete Fourier transform (DFT) and its implementation in MATLAB. It introduces the DFT as a numerically computable alternative to the discrete-time Fourier transform and z-transform. The DFT decomposes a sequence into its constituent frequency components. MATLAB functions like fft and ifft efficiently compute the DFT and inverse DFT using fast Fourier transform algorithms. Zero-padding a sequence provides more samples of its discrete-time Fourier transform without adding new information. Circular convolution relates to the DFT through its properties. Linear convolution can be computed from the DFT of zero-padded sequences.
1. The document discusses frequency response analysis techniques, which analyze how a system responds to input signals of varying frequencies.
2. It describes two common frequency response techniques - Bode plots, which show magnitude and phase response as functions of frequency, and Nyquist plots, which plot magnitude against phase on a polar graph.
3. The techniques provide insights into system stability and dynamics and are useful for control system design, but their use requires complex derivations and they do not always directly indicate transient response characteristics.
Digital Signal Processing (DSP) from basics introduction to medium level book based on Anna University Syllabus! This is just a share of worthfull book!
-Prabhaharan Ellaiyan
-prabhaharan429@gmail.com
-www.insmartworld.blogspot.in
I am Lawrence B. I am a Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Masters's in Matlab from, Durham University, UK. I have been helping students with their assignments for the past 5 years. I solve assignments related to Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Signal Processing Assignments.
I am Bing Jr. I am a Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Master's in Matlab Deakin University, Australia. I have been helping students with their assignments for the past 9 years. I solve assignments related to Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Signal Processing Assignments.
This document summarizes a research paper that proposes using H-infinity optimization to derive a causal approximation for spline interpolation. Spline interpolation is commonly used in image processing but requires filtering past and future data, making it non-causal. The paper formulates designing a causal approximation as an H-infinity optimization problem to minimize the worst-case error over all possible input signals. For cubic splines, a closed-form optimal causal filter is derived. Numerical methods can solve for optimal filters for higher-order splines or when constraining the filter to be finite impulse response. An example is provided to demonstrate the effectiveness of the proposed causal approximation using H-infinity optimization.
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier AnalysisAmr E. Mohamed
This document discusses the discrete-time Fourier transform (DTFT) and its properties. It provides examples of calculating the DTFT of sequences and using it to analyze linear time-invariant (LTI) systems. The key points are:
1. The DTFT represents a discrete-time signal as a complex-valued continuous function of digital frequency. It has periodicity and symmetry properties useful for analysis.
2. LTI systems can be analyzed in the frequency domain using their frequency response, which is the DTFT of the system's impulse response.
3. The steady-state response of an LTI system to an input signal can be computed from the system's frequency response evaluated at the input signal's
Introduction to Fourier transform and signal analysis宗翰 謝
The document discusses Fourier analysis techniques. It introduces continuous and discrete Fourier transforms, and covers properties like orthogonality, completeness of basis functions (e.g. cosines and sines), and Fourier series representations of periodic functions like step functions. It also defines the Fourier transform and its properties like linearity, translation, modulation, scaling, and conjugation. Concepts like Dirac delta functions and convolution theory are explained in relation to Fourier analysis.
The document discusses Fourier analysis techniques. It introduces continuous and discrete Fourier transforms, and covers properties like orthogonality, completeness of basis functions (e.g. cosines and sines), Fourier series expansion of periodic functions, and Fourier transform properties such as linearity, translation and modulation. It also defines the Dirac delta function and discusses convolution theory and the Parseval relation.
The document discusses algorithm analysis and complexity. It covers key topics like asymptotic notation (Big-O, Big-Omega, Big-Theta), time and space complexity analysis, recurrence relations, and a case study on quicksort analysis. The outline presents introduction to algorithms, properties, studying algorithms, complexity concepts, asymptotic notation, recurrence relations, and a quicksort case study.
The Discrete Fourier Transform (DFT) provides a method to represent a discrete time signal in the frequency domain and perform frequency analysis. The DFT samples the Discrete Time Fourier Transform (DTFT) at uniform frequency intervals to obtain a discrete function of frequency that can be processed digitally. The DFT results in a sequence of N complex numbers representing the magnitude and phase of the signal's frequency spectrum, which can be plotted. The Fast Fourier Transform (FFT) was developed to reduce the large number of calculations required by the DFT.
Exponential-plus-Constant Fitting based on Fourier AnalysisMatthieu Hodgkinson
This document presents a Fourier-based method for fitting exponential plus constant (EPC) curves to time-series data. The method estimates the exponent coefficient through Fourier analysis, reducing the problem to linear least squares. Specifically, it takes the discrete Fourier transform of the windowed data to approximate the Fourier series. This provides an estimate of the exponent that only depends on the real and imaginary parts. The remaining coefficients can then be estimated through standard linear least squares on the transformed data. Evaluation on both synthetic and real string vibration data showed it performed well while being faster than traditional nonlinear regression approaches.
International Conference on Monte Carlo techniques
Closing conference of thematic cycle
Paris July 5-8th 2016
Campus les Cordeliers
Slides of Richard Everitt's presentation
The document discusses the discrete Fourier transform (DFT) and its relationship to the discrete-time Fourier transform (DTFT) and discrete Fourier series (DFS). It begins by introducing the DTFT as a theoretical tool to evaluate frequency responses, but notes it cannot be directly computed. The DFT solves this issue by sampling the frequency spectrum. It then discusses how the DFS represents periodic discrete-time signals using complex exponentials, unlike the continuous-time Fourier series. The key properties of the DFS such as linearity, time-shifting, duality, and periodic convolution are also covered. Finally, it discusses how the continuous-time Fourier transform (CTFT) of periodic signals relates to the DFS through Poisson's sum
This document provides an overview of Fourier transforms and the fast Fourier transform (FFT) algorithm. It defines the continuous and discrete Fourier transforms, discusses their properties and examples. The FFT is introduced as an efficient algorithm for computing the discrete Fourier transform (DFT) in O(N log N) time rather than O(N2) time. The FFT decomposes the DFT calculation into butterfly operations between stages for inputs in bit-reversed order.
1. Fourier transforms can be used to analyze aperiodic signals by extending the period to infinity, turning the aperiodic signal into a periodic one. This allows the computation of Fourier coefficients using the continuous-time Fourier transform (CTFT).
2. The CTFT of an aperiodic signal results in a continuous function of frequency rather than discrete frequencies. Key examples are computed, such as the CTFT of an impulse function being 1 for all frequencies and the CTFT of a constant function being an impulse at zero frequency.
3. The CTFT represents the frequency content of a signal and is useful for analyzing aperiodic real-world signals. Examples demonstrate how the CTFT can be used to analyze signals like sinusoids
The debris of the ‘last major merger’ is dynamically youngSérgio Sacani
The Milky Way’s (MW) inner stellar halo contains an [Fe/H]-rich component with highly eccentric orbits, often referred to as the
‘last major merger.’ Hypotheses for the origin of this component include Gaia-Sausage/Enceladus (GSE), where the progenitor
collided with the MW proto-disc 8–11 Gyr ago, and the Virgo Radial Merger (VRM), where the progenitor collided with the
MW disc within the last 3 Gyr. These two scenarios make different predictions about observable structure in local phase space,
because the morphology of debris depends on how long it has had to phase mix. The recently identified phase-space folds in Gaia
DR3 have positive caustic velocities, making them fundamentally different than the phase-mixed chevrons found in simulations
at late times. Roughly 20 per cent of the stars in the prograde local stellar halo are associated with the observed caustics. Based
on a simple phase-mixing model, the observed number of caustics are consistent with a merger that occurred 1–2 Gyr ago.
We also compare the observed phase-space distribution to FIRE-2 Latte simulations of GSE-like mergers, using a quantitative
measurement of phase mixing (2D causticality). The observed local phase-space distribution best matches the simulated data
1–2 Gyr after collision, and certainly not later than 3 Gyr. This is further evidence that the progenitor of the ‘last major merger’
did not collide with the MW proto-disc at early times, as is thought for the GSE, but instead collided with the MW disc within
the last few Gyr, consistent with the body of work surrounding the VRM.
More Related Content
Similar to A Numerical Analytic Continuation and Its Application to Fourier Transform
Numerical Fourier transform based on hyperfunction theoryHidenoriOgata
This is the PC slide of a contributed talk in the conference "ECMI2018 (The 20th European Conference on Mathematics for Industry)", 18-20 June 2018, Budapest, Hungary. In this talk, we propose a numerical method of Fourier transforms based on hyperfunction theory.
Introduction to Digital Signal Processing (DSP) - Course NotesAhmed Gad
Documentation of digital signal processing course giving an introduction to the field.
The course covers the following:
Principles of Digital Signal Processing.
Continuous, Discrete Signals and Systems.
Basic Operations on Signals
Discrete Time System Fundamentals
Discrete Time System.
Convolution
Discrete Fourier Transform.
Continuous Fourier Transform.
Fourier Transform
Discrete Fourier Transform.
Continuous Fourier Transform.
Z-Transform
Laplace Transform
Digital Filter Design
FIR Filter Design.
IIR Filter Design.
Find me on:
AFCIT
http://www.afcit.xyz
YouTube
https://www.youtube.com/channel/UCuewOYbBXH5gwhfOrQOZOdw
Google Plus
https://plus.google.com/u/0/+AhmedGadIT
SlideShare
https://www.slideshare.net/AhmedGadFCIT
LinkedIn
https://www.linkedin.com/in/ahmedfgad/
ResearchGate
https://www.researchgate.net/profile/Ahmed_Gad13
Academia
https://www.academia.edu/
Google Scholar
https://scholar.google.com.eg/citations?user=r07tjocAAAAJ&hl=en
Mendelay
https://www.mendeley.com/profiles/ahmed-gad12/
ORCID
https://orcid.org/0000-0003-1978-8574
StackOverFlow
http://stackoverflow.com/users/5426539/ahmed-gad
Twitter
https://twitter.com/ahmedfgad
Facebook
https://www.facebook.com/ahmed.f.gadd
Pinterest
https://www.pinterest.com/ahmedfgad/
DSP_FOEHU - MATLAB 04 - The Discrete Fourier Transform (DFT)Amr E. Mohamed
The document discusses the discrete Fourier transform (DFT) and its implementation in MATLAB. It introduces the DFT as a numerically computable alternative to the discrete-time Fourier transform and z-transform. The DFT decomposes a sequence into its constituent frequency components. MATLAB functions like fft and ifft efficiently compute the DFT and inverse DFT using fast Fourier transform algorithms. Zero-padding a sequence provides more samples of its discrete-time Fourier transform without adding new information. Circular convolution relates to the DFT through its properties. Linear convolution can be computed from the DFT of zero-padded sequences.
1. The document discusses frequency response analysis techniques, which analyze how a system responds to input signals of varying frequencies.
2. It describes two common frequency response techniques - Bode plots, which show magnitude and phase response as functions of frequency, and Nyquist plots, which plot magnitude against phase on a polar graph.
3. The techniques provide insights into system stability and dynamics and are useful for control system design, but their use requires complex derivations and they do not always directly indicate transient response characteristics.
Digital Signal Processing (DSP) from basics introduction to medium level book based on Anna University Syllabus! This is just a share of worthfull book!
-Prabhaharan Ellaiyan
-prabhaharan429@gmail.com
-www.insmartworld.blogspot.in
I am Lawrence B. I am a Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Masters's in Matlab from, Durham University, UK. I have been helping students with their assignments for the past 5 years. I solve assignments related to Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Signal Processing Assignments.
I am Bing Jr. I am a Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Master's in Matlab Deakin University, Australia. I have been helping students with their assignments for the past 9 years. I solve assignments related to Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Signal Processing Assignments.
This document summarizes a research paper that proposes using H-infinity optimization to derive a causal approximation for spline interpolation. Spline interpolation is commonly used in image processing but requires filtering past and future data, making it non-causal. The paper formulates designing a causal approximation as an H-infinity optimization problem to minimize the worst-case error over all possible input signals. For cubic splines, a closed-form optimal causal filter is derived. Numerical methods can solve for optimal filters for higher-order splines or when constraining the filter to be finite impulse response. An example is provided to demonstrate the effectiveness of the proposed causal approximation using H-infinity optimization.
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier AnalysisAmr E. Mohamed
This document discusses the discrete-time Fourier transform (DTFT) and its properties. It provides examples of calculating the DTFT of sequences and using it to analyze linear time-invariant (LTI) systems. The key points are:
1. The DTFT represents a discrete-time signal as a complex-valued continuous function of digital frequency. It has periodicity and symmetry properties useful for analysis.
2. LTI systems can be analyzed in the frequency domain using their frequency response, which is the DTFT of the system's impulse response.
3. The steady-state response of an LTI system to an input signal can be computed from the system's frequency response evaluated at the input signal's
Introduction to Fourier transform and signal analysis宗翰 謝
The document discusses Fourier analysis techniques. It introduces continuous and discrete Fourier transforms, and covers properties like orthogonality, completeness of basis functions (e.g. cosines and sines), and Fourier series representations of periodic functions like step functions. It also defines the Fourier transform and its properties like linearity, translation, modulation, scaling, and conjugation. Concepts like Dirac delta functions and convolution theory are explained in relation to Fourier analysis.
The document discusses Fourier analysis techniques. It introduces continuous and discrete Fourier transforms, and covers properties like orthogonality, completeness of basis functions (e.g. cosines and sines), Fourier series expansion of periodic functions, and Fourier transform properties such as linearity, translation and modulation. It also defines the Dirac delta function and discusses convolution theory and the Parseval relation.
The document discusses algorithm analysis and complexity. It covers key topics like asymptotic notation (Big-O, Big-Omega, Big-Theta), time and space complexity analysis, recurrence relations, and a case study on quicksort analysis. The outline presents introduction to algorithms, properties, studying algorithms, complexity concepts, asymptotic notation, recurrence relations, and a quicksort case study.
The Discrete Fourier Transform (DFT) provides a method to represent a discrete time signal in the frequency domain and perform frequency analysis. The DFT samples the Discrete Time Fourier Transform (DTFT) at uniform frequency intervals to obtain a discrete function of frequency that can be processed digitally. The DFT results in a sequence of N complex numbers representing the magnitude and phase of the signal's frequency spectrum, which can be plotted. The Fast Fourier Transform (FFT) was developed to reduce the large number of calculations required by the DFT.
Exponential-plus-Constant Fitting based on Fourier AnalysisMatthieu Hodgkinson
This document presents a Fourier-based method for fitting exponential plus constant (EPC) curves to time-series data. The method estimates the exponent coefficient through Fourier analysis, reducing the problem to linear least squares. Specifically, it takes the discrete Fourier transform of the windowed data to approximate the Fourier series. This provides an estimate of the exponent that only depends on the real and imaginary parts. The remaining coefficients can then be estimated through standard linear least squares on the transformed data. Evaluation on both synthetic and real string vibration data showed it performed well while being faster than traditional nonlinear regression approaches.
International Conference on Monte Carlo techniques
Closing conference of thematic cycle
Paris July 5-8th 2016
Campus les Cordeliers
Slides of Richard Everitt's presentation
The document discusses the discrete Fourier transform (DFT) and its relationship to the discrete-time Fourier transform (DTFT) and discrete Fourier series (DFS). It begins by introducing the DTFT as a theoretical tool to evaluate frequency responses, but notes it cannot be directly computed. The DFT solves this issue by sampling the frequency spectrum. It then discusses how the DFS represents periodic discrete-time signals using complex exponentials, unlike the continuous-time Fourier series. The key properties of the DFS such as linearity, time-shifting, duality, and periodic convolution are also covered. Finally, it discusses how the continuous-time Fourier transform (CTFT) of periodic signals relates to the DFS through Poisson's sum
This document provides an overview of Fourier transforms and the fast Fourier transform (FFT) algorithm. It defines the continuous and discrete Fourier transforms, discusses their properties and examples. The FFT is introduced as an efficient algorithm for computing the discrete Fourier transform (DFT) in O(N log N) time rather than O(N2) time. The FFT decomposes the DFT calculation into butterfly operations between stages for inputs in bit-reversed order.
1. Fourier transforms can be used to analyze aperiodic signals by extending the period to infinity, turning the aperiodic signal into a periodic one. This allows the computation of Fourier coefficients using the continuous-time Fourier transform (CTFT).
2. The CTFT of an aperiodic signal results in a continuous function of frequency rather than discrete frequencies. Key examples are computed, such as the CTFT of an impulse function being 1 for all frequencies and the CTFT of a constant function being an impulse at zero frequency.
3. The CTFT represents the frequency content of a signal and is useful for analyzing aperiodic real-world signals. Examples demonstrate how the CTFT can be used to analyze signals like sinusoids
Similar to A Numerical Analytic Continuation and Its Application to Fourier Transform (20)
The debris of the ‘last major merger’ is dynamically youngSérgio Sacani
The Milky Way’s (MW) inner stellar halo contains an [Fe/H]-rich component with highly eccentric orbits, often referred to as the
‘last major merger.’ Hypotheses for the origin of this component include Gaia-Sausage/Enceladus (GSE), where the progenitor
collided with the MW proto-disc 8–11 Gyr ago, and the Virgo Radial Merger (VRM), where the progenitor collided with the
MW disc within the last 3 Gyr. These two scenarios make different predictions about observable structure in local phase space,
because the morphology of debris depends on how long it has had to phase mix. The recently identified phase-space folds in Gaia
DR3 have positive caustic velocities, making them fundamentally different than the phase-mixed chevrons found in simulations
at late times. Roughly 20 per cent of the stars in the prograde local stellar halo are associated with the observed caustics. Based
on a simple phase-mixing model, the observed number of caustics are consistent with a merger that occurred 1–2 Gyr ago.
We also compare the observed phase-space distribution to FIRE-2 Latte simulations of GSE-like mergers, using a quantitative
measurement of phase mixing (2D causticality). The observed local phase-space distribution best matches the simulated data
1–2 Gyr after collision, and certainly not later than 3 Gyr. This is further evidence that the progenitor of the ‘last major merger’
did not collide with the MW proto-disc at early times, as is thought for the GSE, but instead collided with the MW disc within
the last few Gyr, consistent with the body of work surrounding the VRM.
Current Ms word generated power point presentation covers major details about the micronuclei test. It's significance and assays to conduct it. It is used to detect the micronuclei formation inside the cells of nearly every multicellular organism. It's formation takes place during chromosomal sepration at metaphase.
Immersive Learning That Works: Research Grounding and Paths ForwardLeonel Morgado
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
The use of Nauplii and metanauplii artemia in aquaculture (brine shrimp).pptxMAGOTI ERNEST
Although Artemia has been known to man for centuries, its use as a food for the culture of larval organisms apparently began only in the 1930s, when several investigators found that it made an excellent food for newly hatched fish larvae (Litvinenko et al., 2023). As aquaculture developed in the 1960s and ‘70s, the use of Artemia also became more widespread, due both to its convenience and to its nutritional value for larval organisms (Arenas-Pardo et al., 2024). The fact that Artemia dormant cysts can be stored for long periods in cans, and then used as an off-the-shelf food requiring only 24 h of incubation makes them the most convenient, least labor-intensive, live food available for aquaculture (Sorgeloos & Roubach, 2021). The nutritional value of Artemia, especially for marine organisms, is not constant, but varies both geographically and temporally. During the last decade, however, both the causes of Artemia nutritional variability and methods to improve poorquality Artemia have been identified (Loufi et al., 2024).
Brine shrimp (Artemia spp.) are used in marine aquaculture worldwide. Annually, more than 2,000 metric tons of dry cysts are used for cultivation of fish, crustacean, and shellfish larva. Brine shrimp are important to aquaculture because newly hatched brine shrimp nauplii (larvae) provide a food source for many fish fry (Mozanzadeh et al., 2021). Culture and harvesting of brine shrimp eggs represents another aspect of the aquaculture industry. Nauplii and metanauplii of Artemia, commonly known as brine shrimp, play a crucial role in aquaculture due to their nutritional value and suitability as live feed for many aquatic species, particularly in larval stages (Sorgeloos & Roubach, 2021).
ESPP presentation to EU Waste Water Network, 4th June 2024 “EU policies driving nutrient removal and recycling
and the revised UWWTD (Urban Waste Water Treatment Directive)”
Phenomics assisted breeding in crop improvementIshaGoswami9
As the population is increasing and will reach about 9 billion upto 2050. Also due to climate change, it is difficult to meet the food requirement of such a large population. Facing the challenges presented by resource shortages, climate
change, and increasing global population, crop yield and quality need to be improved in a sustainable way over the coming decades. Genetic improvement by breeding is the best way to increase crop productivity. With the rapid progression of functional
genomics, an increasing number of crop genomes have been sequenced and dozens of genes influencing key agronomic traits have been identified. However, current genome sequence information has not been adequately exploited for understanding
the complex characteristics of multiple gene, owing to a lack of crop phenotypic data. Efficient, automatic, and accurate technologies and platforms that can capture phenotypic data that can
be linked to genomics information for crop improvement at all growth stages have become as important as genotyping. Thus,
high-throughput phenotyping has become the major bottleneck restricting crop breeding. Plant phenomics has been defined as the high-throughput, accurate acquisition and analysis of multi-dimensional phenotypes
during crop growing stages at the organism level, including the cell, tissue, organ, individual plant, plot, and field levels. With the rapid development of novel sensors, imaging technology,
and analysis methods, numerous infrastructure platforms have been developed for phenotyping.
When I was asked to give a companion lecture in support of ‘The Philosophy of Science’ (https://shorturl.at/4pUXz) I decided not to walk through the detail of the many methodologies in order of use. Instead, I chose to employ a long standing, and ongoing, scientific development as an exemplar. And so, I chose the ever evolving story of Thermodynamics as a scientific investigation at its best.
Conducted over a period of >200 years, Thermodynamics R&D, and application, benefitted from the highest levels of professionalism, collaboration, and technical thoroughness. New layers of application, methodology, and practice were made possible by the progressive advance of technology. In turn, this has seen measurement and modelling accuracy continually improved at a micro and macro level.
Perhaps most importantly, Thermodynamics rapidly became a primary tool in the advance of applied science/engineering/technology, spanning micro-tech, to aerospace and cosmology. I can think of no better a story to illustrate the breadth of scientific methodologies and applications at their best.
Unlocking the mysteries of reproduction: Exploring fecundity and gonadosomati...AbdullaAlAsif1
The pygmy halfbeak Dermogenys colletei, is known for its viviparous nature, this presents an intriguing case of relatively low fecundity, raising questions about potential compensatory reproductive strategies employed by this species. Our study delves into the examination of fecundity and the Gonadosomatic Index (GSI) in the Pygmy Halfbeak, D. colletei (Meisner, 2001), an intriguing viviparous fish indigenous to Sarawak, Borneo. We hypothesize that the Pygmy halfbeak, D. colletei, may exhibit unique reproductive adaptations to offset its low fecundity, thus enhancing its survival and fitness. To address this, we conducted a comprehensive study utilizing 28 mature female specimens of D. colletei, carefully measuring fecundity and GSI to shed light on the reproductive adaptations of this species. Our findings reveal that D. colletei indeed exhibits low fecundity, with a mean of 16.76 ± 2.01, and a mean GSI of 12.83 ± 1.27, providing crucial insights into the reproductive mechanisms at play in this species. These results underscore the existence of unique reproductive strategies in D. colletei, enabling its adaptation and persistence in Borneo's diverse aquatic ecosystems, and call for further ecological research to elucidate these mechanisms. This study lends to a better understanding of viviparous fish in Borneo and contributes to the broader field of aquatic ecology, enhancing our knowledge of species adaptations to unique ecological challenges.
Unlocking the mysteries of reproduction: Exploring fecundity and gonadosomati...
A Numerical Analytic Continuation and Its Application to Fourier Transform
1. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
A Numerical Analytic Continuation and
Its Application to Fourier Transform
Hidenori Ogata
Dept. Computer and Network Engineering,
The Graduate School of Informatics and Engineering,
The Univerisity of Electro-Communications, Tokyo, Japan
18 September, 2018
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
2. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
Contents
1 Proposition of a numerical method of
the analytic continuation of analytic functions
using continued fractions.
2 Application of the proposed method of analytic continuation
to the computation of Fourier transforms.
3 Numerical examples
which show the effectiveness of the proposed method
4 Summary
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
3. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
Let’s consider an analytic function f (z) given in a Taylor series
f (z) =
∞
n=0
cnzn
and its analytic continuation.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
4. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
We get an analytic continuation of the analytic function f (z)
by transforming it into a continued fraction.
f (z) =
∞
n=0
cnzn
⇒ f (z) =
a1
1 +
a2z
1 +
a3z
1 +
...
.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
5. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
We get an analytic continuation of the analytic function f (z)
by transforming it into a continued fraction.
f (z) =
∞
n=0
cnzn
⇒ f (z) =
a1
1 +
a2z
1 +
a3z
1 +
...
.
Why continued fractions?
The reasons are as follows.
1 It converges in a wide region.
2 It is easy to compute.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
6. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
1 A continued fraction converges in a wide region.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
7. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
1 A continued fraction converges in a wide region.
Taylor series
f (z) =
∞
n=0
cnzn
.
R
converges
in a disk |z| < R
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
8. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
1 A continued fraction converges in a wide region.
The Taylor series can be transformed into a continued fraction
under some condition.
continued fraction
f (z) =
a1
1 +
a2z
1 +
a3z
1 +
...
R
converges∗
in a plane with a cut
∗
There is a possibility that f (z) = ∞.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
9. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using continued fractions
1 A continued fraction converges in a wide region.
continued fraction
f (z) =
a1
1 +
a2z
1 +
a3z
1 +
...
R
analytic continuation
disk → plane with a cut∗
∗
There is a possibility that f (z) = ∞.
We can get an analytic continuation of f (z)
by transforming it into a continued fraction.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
10. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analytic continuation using a continued fraction
2 A continued fraction is easy to compute.
We can easily compute the continued fraction
by the recurrence formula for the approximants
fn(z) =
pn(z)
qn(z)
≡
a1
1
+
a2z
1
+
a3z
1
+ · · · +
anz
1
,
p0 = 0, q0 = 1, p1 = a1, q1 = 1,
pn(z) = anz pn−2(z) + pn−1(z)
qn(z) = anz qn−2(z) + qn−1(z),
( n = 2, 3, . . .).
The approximant converges fast, i.e.,
fn(z) → f (z) as n → ∞, exponentially.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
11. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analyticity and convergence of the continued fraction
Once we obtain the continued fraction,
it satisfies the following theorem
on its analyticity and convergence.
f (z) =
a1
1
+
a2z
1
+
a3z
1
+ · · · ,
a = lim
n→∞
an = 0,
S : a plane with a cut as in the figure
S
a
−1/(4a)
O
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
12. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Analyticity and convergence of the continued fraction
f (z) =
a1
1
+
a2z
1
+
a3z
1
+ · · · ,
a = lim
n→∞
an = 0,
S
a
−1/(4a)
O
1 The continued fraction is meromorphic in S.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
13. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1.Analyticity and convergence of the continued fraction
2 Let T(⊂ S) be an arbitrary compact set.
For arbitrary ǫ > 0, there exists m ∈ N s.t.
|f ∗
m,n(z) − f ∗
m(z)| ≦ C(θT + ǫ)n
( ∀n > m, ∀z ∈ T ),
S
a
−1/(4a)
O
T
where
f ∗
m(z) =
amz
1
+
am+1z
1
+ · · ·
a tail of
the continued fraction
,
f ∗
m,n(z) =
amz
1
+
am+1z
1
+ · · · +
anz
1
,
θT ( 0 < θT < 1 ) : const. depending on T only.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
14. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1.Analyticity and convergence of the continued fraction
2 Let T(⊂ S) be an arbitrary compact set.
For arbitrary ǫ > 0, there exists m ∈ N s.t.
|f ∗
m,n(z) − f ∗
m(z)| ≦ C(θT + ǫ)n
( ∀n > m, ∀z ∈ T ),
exponential convergence
S
a
−1/(4a)
O
T
where
f ∗
m(z) =
amz
1
+
am+1z
1
+ · · ·
a tail of
the continued fraction
,
f ∗
m,n(z) =
amz
1
+
am+1z
1
+ · · · +
anz
1
,
θT ( 0 < θT < 1 ) : const. depending on T only.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
15. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Numerical analytic continuation
As seen above, once we obtain the continued fraction
corresponding to the analytic function f (z),
it gives an analytic continuation of f (z)
which we can easily compute.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
16. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Numerical analytic continuation
As seen above, once we obtain the continued fraction
corresponding to the analytic function f (z),
it gives an analytic continuation of f (z)
which we can easily compute.
How can we obtain the continued fraction?
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
17. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Numerical analytic continuation: QD algorithm
How can we get the continued fraction corresponding to f (z) = cnzn
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
18. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Numerical analytic continuation: QD algorithm
How can we get the continued fraction corresponding to f (z) = cnzn
Quotient-difference (QD) algorithm
We generate the sequences e
(n)
k and q
(n)
k by
e
(n)
0 = 0, q
(n)
1 = cn+1/cn ( n = 0, 1, 2, . . . ),
e
(n)
k = q
(n+1)
k − q
(n)
k + e
(n+1)
k−1 , q
(n)
k+1 = (e
(n+1)
k /e
(n)
k )q
(n+1)
k
( n = 0, 1, . . .; k = 1, 2, . . . ).
f (z) =
c0
1
−
q
(0)
1 z
1
−
e
(0)
1 z
1
−
q
(0)
2 z
1
−
e
(0)
2 z
1
− · · · .
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
19. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
1. Numerical analytic continuation: QD algorithm
How can we get the continued fraction corresponding to f (z) = cnzn
Quotient-difference (QD) algorithm
We generate the sequences e
(n)
k and q
(n)
k by
e
(n)
0 = 0, q
(n)
1 = cn+1/cn ( n = 0, 1, 2, . . . ),
e
(n)
k = q
(n+1)
k − q
(n)
k + e
(n+1)
k−1 , q
(n)
k+1 = (e
(n+1)
k /e
(n)
k )q
(n+1)
k
( n = 0, 1, . . .; k = 1, 2, . . . ).
f (z) =
c0
1
−
q
(0)
1 z
1
−
e
(0)
1 z
1
−
q
(0)
2 z
1
−
e
(0)
2 z
1
− · · · .
The QD algorithm is numerically unstable.
⇒ multiple precision arithmetics
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
20. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
2. Numerical Fourier transform
We consider a Fourier transform
F[f ](ξ) =
∞
−∞
f (x)e−2πiξx
dx.
Familiar and important in science and engineering.
It is difficult to compute one
by conventional numerical quadrature rules
especially for slowly decaying functions f (x).
We can compute F[f ](ξ) by the proposed method of
analytic continuation.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
21. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
2. Numerical Fourier transform
Rewrite F[f ](ξ) =
∞
−∞
f (x)e−2πiξx
dx (1)
⇓
F[f ](ξ) = lim
ǫ→0+
0
−∞
f (x)e−2πi(ξ+iǫ)x
dx +
+∞
0
f (x)e−2πi(ξ−iǫ)x
dx .
e−2πǫ|x| : convergence factor
We can define F[f ](ξ) even if the integral (1) does not exist
in the conventional sense.
∗ definition of a Fourier transform in hyperfunction theory.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
22. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
2. Numerical Fourier transform
By rewriting F[f ](ξ), the problem of the Fourier transform is
reduced to that of an analytic continuation.
F[f ](ξ) =
∞
−∞
f (x)e−2πiξx
dx
= lim
ǫ→0+
{F+(ξ + iǫ) − F−(ξ − iǫ)} ( ξ ∈ R ),
where
F+(ζ) =
0
−∞
f (x)e−2πiζx
dx analytic in Im ζ > 0,
F−(ζ) = −
∞
0
f (x)e−2πiζx
dx analytic in Im ζ < 0.
We can get F[f ](ξ)
by the analytic continuation of F±(ζ) onto R.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
23. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
2. Numerical Fourier transform
Actually, we get F[f ](ξ) by the following algorithm.
1 We compute F±(ζ) in ± Im ζ > 0.
First, we choose ζ
(±)
0 s.t. ± Im ζ
(±)
0 > 0.
F±(ζ) =
∞
n=0
c(±)
n (ζ − ζ
(±)
0 )n
( ± Im ζ
(±)
0 > 0 ),
c(±)
n =
1
n!
F
(n)
± (ζ
(±)
0 ) = ±
1
n!
∞
0
(±2πix)n
f (∓x)e±2πiζ
(±)
0 x
exponential decay
dx.
We can compute c
(±)
n by conventional numerical quadrature rules.
2 We get F[f ](ξ) by the analytic continuation of F±(ζ) onto R.
F[f ](ξ) = lim
ǫ→0+
{F+(ξ + iǫ) − F−(ξ − iǫ)} ( ξ ∈ R ).
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
24. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples: Analytic continuation
The analytic continuation of
f (z) = 1 −
z
2
+
z2
3
− · · · =
log(1 + z)
z
( |z| < 1 ).
Throughout this study, we carried out all the computations
using C++ programs
in 100 decimal digit precision (using exflib)
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
26. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples: Analytic continuation
The analytic continuation of
f (z) = 1 −
z
2
+
z2
3
− · · · =
log(1 + z)
z
( |z| < 1 ).
The error of the analytic continuation of f (z).
-3 -2 -1 0 1 2 3Re(z)
-3
-2
-1
0
1
2
3
Im(z)
1.0e-50
1.0e-40
1.0e-30
1.0e-20
1.0e-10
1.0e+00
|error|
1.0e-60
1.0e-50
1.0e-40
1.0e-30
1.0e-20
1.0e-10
1.0e+00
-3 -2 -1 0 1 2 3
|error|
Re(z)
Im(z)=0
Im(z)=0.5
Im(z)=1
We can compute the analytic continuation in S = C {x ≦ −1}.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
27. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples: Analytic continuation
(1) f (z) = 1 − z/2 + z2
/3 − · · · (= z−1
log(1 + z)) ( |z| < 1 ),
(2) f (z) = z − z3
/3 + z5
/5 − · · · (= arctan z) ( |z| < 1 ).
-35
-30
-25
-20
-15
-10
-5
0
0 5 10 15 20 25 30 35 40
log10(error)
n
z=1
z=2
z=1+i
-35
-30
-25
-20
-15
-10
-5
0
0 5 10 15 20 25 30 35 40
log10(error)
n
z=1
z=2
z=1+i
(1) (2)
Errors with the continued fractions truncated at the n-th term.
( vertical axis: log10(error), horizontal axis: n )
Our method gives exponential convergence.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
28. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples: Zeta functions
We can also apply the numerical analytic continuation
to the compution of ζ(s).
ζ(s) =
∞
n=1
1
ns
=
fs (1)
1 − 21−s
, where fs (z) =
∞
n=0
(−1)n
(n + 1)s
zn
(|z| < 1 ).
We compute fs(1) by the numerical analytic continuation.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
29. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples: Zeta functions
We can also apply the numerical analytic continuation
to the compution of ζ(s).
ζ(s) =
∞
n=1
1
ns
=
fs (1)
1 − 21−s
, where fs (z) =
∞
n=0
(−1)n
(n + 1)s
zn
(|z| < 1 ).
We compute fs(1) by the numerical analytic continuation.
Results with the continued fractions truncated at the n-th term.
n ζ(3) error
5 1.2020 46303 07249 1.1e-05
10 1.2020 56904 61243 1.5e-09
15 1.2020 56903 15940 2.0e-13
20 1.2020 56903 15959 2.9e-17
· · ·
exact value 1.2020 56903 15959 . . .
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
30. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples: Fourier transforms
The Fourier transforms
(1) F[tanh(πx)](ξ), (2) F[(1+x2
)−2
](ξ), (3) F[log |x|](ξ).
1.0e-45
1.0e-40
1.0e-35
1.0e-30
1.0e-25
1.0e-20
1.0e-15
1.0e-10
1.0e-05
1.0e+00
-4 -2 0 2 4
|error|
xi
(1)
(2)
(3)
vertical axis: error
horizontal axis: ξ
Our method works well (especially for (1)).
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
31. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples
Comparison with the previous methods
1 Sugihara’s method
using the DE rule & the Richardson extrapolation (1987)
2 DE-type rule for oscillatory integrals by T. Ooura & Mori (1991)
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
32. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
3. Numerical examples
Comparison with the previous methods
1 Sugihara’s method
using the DE rule & the Richardson extrapolation (1987)
2 DE-type rule for oscillatory integrals by T. Ooura & Mori (1991)
F[tanh(πx)](ξ = 1) = −i cosechπ.
number of the evaluations
of f (x) = tanh(πx) error
our method 666 7.4e-43
(1) DE & Richardson 17156 7.8e-21
(2) DE for
oscillatory integrals 1892 1.5e-46
Our method is superior to the previous methods for this example.
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
33. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
Summary
1 We proposed a numerical method of analytic continuation
using continued fractions
2 We applied the method to Fourier transforms
3 Numerical examples show the effectiveness of our method.
Problem for future study
1 reduce the cost of transforming a given analytic function
into a continued fraction
(The present method needs multiple precision arithmetics
due to the instability of the QD algorithm).
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier
34. Numerical analytic continuation
Numerical Fourier transform
Numerical examples
Summary
Summary
1 We proposed a numerical method of analytic continuation
using continued fractions
2 We applied the method to Fourier transforms
3 Numerical examples show the effectiveness of our method.
Problem for future study
1 reduce the cost of transforming a given analytic function
into a continued fraction
(The present method needs multiple precision arithmetics
due to the instability of the QD algorithm).
Thank you very much!
Hidenori Ogata A Numerical Analytic Continuation and Its Application to Fourier