Dariusz W. Brzezinski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dariusz W. Brzezinski has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Piotr Ostalczyk
Lodz University of Technology
11 shared publications - Dominik Sankowski
Institute of Applied Computer Science, Lodz University of Technology, Poland
2 shared publications - Piotr Duch
Lodz University of Technology
2 shared publications - Ashok Kumar Pal
Department of Mathematics and Statistics, Manipal University Jaipur, Jaipur, India
1 shared publication Dariusz W.
1 shared publication- Elbaz I. Abouelmagd
Celestial Mechanics and Space Dynamics Research Group (CMSDRG), Astronomy Department, National Research Institute of Astronomy and Geophysics (NRIAG), Helwan, Egypt
1 shared publication
Latest Publications
- Open Access
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 902
Improving Effectiveness of Automata Theory Teaching Using Computational Thinking
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 902
Open AccessImproving Effectiveness of Automata Theory Teaching Using Computational Thinking
- Open Access
Periodic Solutions of Nonlinear Relative Motion Satellites
The relative motion of an outline of the rendezvous problem has been studied by assuming that the chief satellite is in circular symmetric orbits. The legitimacy of perturbation techniques and nonlinear relative motion are investigated. The deputy satellite equations of motion with respect to the fixed references at the center of the chief satellite are nonlinear in the general case. We found the periodic solutions of the linear relative motion satellite and for the nonlinear relative motion satellite using the Lindstedt–Poincaré technique. Comparisons among the analytical solutions of linear and nonlinear motions and the obtained solution by the numerical integration of the explicit Euler method for both motions are investigated. We demonstrate that both analytical and numerical solutions of linear motion are symmetric periodic. However, the solutions of nonlinear motion obtained by the Lindstedt–Poincaré technique are periodic and the numerical solutions obtained by integration by using explicit Euler method are non-periodic. Thus, the Lindstedt–Poincaré technique is recommended for designing the periodic solutions. Furthermore, a comparison between linear and nonlinear analytical solutions of relative motion is investigated graphically.
Open AccessPeriodic Solutions of Nonlinear Relative Motion Satellites
The relative motion of an outline of the rendezvous problem has been studied by assuming that the chief satellite is in circular symmetric orbits. The legitimacy of perturbation techniques and nonlinear relative motion are investigated. The deputy satellite equations of motion with respect to the fixed references at the center of the chief satellite are nonlinear in the general case. We found the periodic solutions of the linear relative motion satellite and for the nonlinear relative motion satellite using the Lindstedt–Poincaré technique. Comparisons among the analytical solutions of linear and nonlinear motions and the obtained solution by the numerical integration of the explicit Euler method for both motions are investigated. We demonstrate that both analytical and numerical solutions of linear motion are symmetric periodic. However, the solutions of nonlinear motion obtained by the Lindstedt–Poincaré technique are periodic and the numerical solutions obtained by integration by using explicit Euler method are non-periodic. Thus, the Lindstedt–Poincaré technique is recommended for designing the periodic solutions. Furthermore, a comparison between linear and nonlinear analytical solutions of relative motion is investigated graphically.
- Open Access
A Chebyshev Wavelet Collocation Method for Some Types of Differential Problems
In the past decade, various types of wavelet-based algorithms were proposed, leading to a key tool in the solution of a number of numerical problems. This work adopts the Chebyshev wavelets for the numerical solution of several models. A Chebyshev operational matrix is developed, for selected collocation points, using the fundamental properties. Moreover, the convergence of the expansion coefficients and an upper estimate for the truncation error are included. The obtained results for several case studies illustrate the accuracy and reliability of the proposed approach.
Open AccessA Chebyshev Wavelet Collocation Method for Some Types of Differential Problems
In the past decade, various types of wavelet-based algorithms were proposed, leading to a key tool in the solution of a number of numerical problems. This work adopts the Chebyshev wavelets for the numerical solution of several models. A Chebyshev operational matrix is developed, for selected collocation points, using the fundamental properties. Moreover, the convergence of the expansion coefficients and an upper estimate for the truncation error are included. The obtained results for several case studies illustrate the accuracy and reliability of the proposed approach.
- 12 March 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 17 (05)
Fractional Order Derivative and Integral Computation with a Small Number of Discrete Input Values Using Grünwald–Letnikov Formula
High-accuracy computer approximation of fractional derivatives and integrals by applying Grünwald–Letnikov formula generally requires a large number of input values. If required amount cannot be supplied, accuracy of approximation drops drastically. In this paper, we solve a difficult problem in this scope, i.e., when input data consists only of a small number of discrete values. Furthermore, some of the values may be unusable for computational purposes. Our problem solution includes an appropriate method of input data preprocessing, an interpolation algorithm with extrapolation abilities, a central point function discretization schema, recurrent computational method of coefficients and application of Horner’s schema for the core of the Grünwald–Letnikov method: coefficients and function’s values multiplication. Numerical method presented in the paper enables to compute fractional derivatives and integrals of complicated functions with much higher accuracy than it is possible when application of the default approach to Grünwald–Letnikov method computer implementation is applied. This new method usually takes only 10% of function’s values required by the default approach for the same computations and is much less restrictive for their quality. The general novelty of the method is an efficient configuration of existing numerical methods and enhancement of their abilities by applying modern programming language — Python and arbitrary precision arithmetic for computations.
- 12 March 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 17 (05)
Fractional Order Derivative and Integral Computation with a Small Number of Discrete Input Values Using Grünwald–Letnikov Formula
High-accuracy computer approximation of fractional derivatives and integrals by applying Grünwald–Letnikov formula generally requires a large number of input values. If required amount cannot be supplied, accuracy of approximation drops drastically. In this paper, we solve a difficult problem in this scope, i.e., when input data consists only of a small number of discrete values. Furthermore, some of the values may be unusable for computational purposes. Our problem solution includes an appropriate method of input data preprocessing, an interpolation algorithm with extrapolation abilities, a central point function discretization schema, recurrent computational method of coefficients and application of Horner’s schema for the core of the Grünwald–Letnikov method: coefficients and function’s values multiplication. Numerical method presented in the paper enables to compute fractional derivatives and integrals of complicated functions with much higher accuracy than it is possible when application of the default approach to Grünwald–Letnikov method computer implementation is applied. This new method usually takes only 10% of function’s values required by the default approach for the same computations and is much less restrictive for their quality. The general novelty of the method is an efficient configuration of existing numerical methods and enhancement of their abilities by applying modern programming language — Python and arbitrary precision arithmetic for computations.
- 26 September 2018
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 15, 297-306
Computation of Gauss-Jacobi Quadrature Nodes and Weights with Arbitrary Precision
- 26 September 2018
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 15, 297-306
Computation of Gauss-Jacobi Quadrature Nodes and Weights with Arbitrary Precision
- Open Access
- 1 July 2018
- Published by Erdos Publish House in Applied Mathematics and Nonlinear Sciences
- Vol. 3 (2) , 487-502
Review of numerical methods for NumILPT with computational accuracy assessment for fractional calculus
In the paper we present results of accuracy evaluation of numerous numerical algorithms for the numerical approximation of the Inverse Laplace Transform. The selected algorithms represent diverse lines of approach to this problem and include methods by Stehfest, Abate and Whitt, Vlach and Singhai, De Hoog, Talbot, Zakian and a one in which the FFT is applied for the Fourier series convergence acceleration. We use C++ and Python languages with arbitrary precision mathematical libraries to address some crucial issues of numerical implementation. The test set includes Laplace transforms considered as difficult to compute as well as some others commonly applied in fractional calculus. Evaluation results enable to conclude that the Talbot method which involves deformed Bromwich contour integration, the De Hoog and the Abate and Whitt methods using Fourier series expansion with accelerated convergence can be assumed as general purpose high-accuracy algorithms. They can be applied to a wide variety of inversion problems.
- 1 July 2018
- Published by Erdos Publish House in Applied Mathematics and Nonlinear Sciences
- Vol. 3 (2) , 487-502
Open AccessReview of numerical methods for NumILPT with computational accuracy assessment for fractional calculus
In the paper we present results of accuracy evaluation of numerous numerical algorithms for the numerical approximation of the Inverse Laplace Transform. The selected algorithms represent diverse lines of approach to this problem and include methods by Stehfest, Abate and Whitt, Vlach and Singhai, De Hoog, Talbot, Zakian and a one in which the FFT is applied for the Fourier series convergence acceleration. We use C++ and Python languages with arbitrary precision mathematical libraries to address some crucial issues of numerical implementation. The test set includes Laplace transforms considered as difficult to compute as well as some others commonly applied in fractional calculus. Evaluation results enable to conclude that the Talbot method which involves deformed Bromwich contour integration, the De Hoog and the Abate and Whitt methods using Fourier series expansion with accelerated convergence can be assumed as general purpose high-accuracy algorithms. They can be applied to a wide variety of inversion problems.
- 1 November 2016
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 40, 151-162
About accuracy increase of fractional order derivative and integral computations by applying the Grünwald–Letnikov formula
- 1 November 2016
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 40, 151-162
About accuracy increase of fractional order derivative and integral computations by applying the Grünwald–Letnikov formula
- 1 November 2015
- Published by L and H Scientific Publishing, LLC in The Interdisciplinary Journal of Discontinuity, Nonlinearity, and Complexity
- Vol. 4 (4) , 499-509
The Double Exponential Formula as a Gauss Quadratures Replacement for Numerical Integration
- 1 November 2015
- Published by L and H Scientific Publishing, LLC in The Interdisciplinary Journal of Discontinuity, Nonlinearity, and Complexity
- Vol. 4 (4) , 499-509
The Double Exponential Formula as a Gauss Quadratures Replacement for Numerical Integration
- 1 November 2015
- Published by L and H Scientific Publishing, LLC in The Interdisciplinary Journal of Discontinuity, Nonlinearity, and Complexity
- Vol. 4 (4) , 487-498
About Utility of the Simplified Gr¨unwald-Letnikov Formula Equivalent Horner Form
- 1 November 2015
- Published by L and H Scientific Publishing, LLC in The Interdisciplinary Journal of Discontinuity, Nonlinearity, and Complexity
- Vol. 4 (4) , 487-498
About Utility of the Simplified Gr¨unwald-Letnikov Formula Equivalent Horner Form
- 8 July 2015
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 84 (1) , 65-77
Numerical calculations accuracy comparison of the Inverse Laplace Transform algorithms for solutions of fractional order differential equations
- 8 July 2015
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 84 (1) , 65-77
Numerical calculations accuracy comparison of the Inverse Laplace Transform algorithms for solutions of fractional order differential equations