580 California St., Suite 400
San Francisco, CA, 94104
Key research themes
1. How can convergence properties of iterative methods be improved and analyzed for nonlinear equations in computational mathematics?
This theme focuses on the development, convergence analysis, and efficiency improvements of iterative methods tailored for solving nonlinear equations and systems, which are central to many applied scientific and engineering problems. The research emphasizes creating iterative schemes with higher order convergence, establishing local and semi-local convergence theorems, and blending classical methods like Newton-Raphson with novel techniques to achieve faster and more reliable convergence. Comprehensive convergence analysis including error bounds and domain of convergence is crucial for practical implementation and robustness.
Key finding: Introduced three cubic (third-order) iterative methods based on Taylor series expansion for solving nonlinear equations, with proofs of third-order convergence and demonstrated superior accuracy and faster convergence... Read more
Key finding: Established new local and semi-local convergence theorems for two multi-step iterative methods with orders of convergence 5 and 5 + 3p, addressing limitations in prior analyses by removing the need for higher-order... Read more
Key finding: Developed a three-step iterative method blending Newton-Raphson with a third-order method resulting in an algorithm attaining sixth-order convergence using only five function evaluations per iteration, successfully applied to... Read more
Key finding: Reviewed and presented recent advances in fixed-point iterative methods for nonlinear equations and systems with a focus on their applications across diverse fields such as economics, engineering and physics, highlighting the... Read more
2. What are the convergence behaviors and acceleration techniques of fixed point iterative processes in complex-valued Banach and metric spaces?
This research theme investigates fixed point iterative processes in complex-valued Banach spaces and metric spaces, focusing on rational contractive mappings and their approximation by high-rate iterative schemes. The studies examine hybrid iterative processes combining Picard, Ishikawa, Krasnoselskii, Mann, and Noor iterations to enhance convergence speed and stability. Theoretical results on existence, uniqueness, Fejér monotonicity, and stability are established, with applications in solving delay differential and nonlinear integral equations in complex-valued contexts. These advances deepen understanding of iterative approximations beyond classical real-valued settings.
Key finding: Introduced the Picard-Ishikawa hybrid iterative process, proving that it converges faster than the classical Picard, Krasnoselskii, Mann, Ishikawa, Noor, Picard-Mann, and Picard-Krasnoselskii processes based on Berinde's rate... Read more
Key finding: Proved existence and uniqueness of fixed points for mappings satisfying rational contractive inequalities in complex-valued Banach spaces and developed convergent iterative schemes for approximating these fixed points with... Read more
Key finding: Established fixed point results and Fejér monotonicity properties for iterative sequences generated by nonlinear operators under rational inequalities in complex-valued Banach spaces, demonstrating the validity of these... Read more
3. How do iterative processes and computational models interplay with system dynamics and software engineering in applied contexts?
This theme explores the modeling of iterative computation as discrete dynamical systems in computational mathematics, numerical methods, and software engineering. It examines iterative procedures' convergence behaviors, their power and limitations, and their visualization as state-space dynamical systems. Additionally, it includes studies on iterative methods for solving large system linear algebraic equations in exascale computational environments, and iterative process models for software development emphasizing user participation and complexity management. The interdisciplinary approach bridges theory with applications in numerical analysis, process science, and organizational dynamics.
Key finding: Provided an in-depth conceptual analysis of iterative methods, focusing on Krylov subspace techniques like the conjugate gradient method for solving large sparse SPD linear systems at exascale computing scale; highlighted... Read more
Key finding: Proposed a unifying perspective treating algorithms as discrete dynamical (iterative) systems, enabling mapping of key computational concepts such as fixed points, invariants, and termination to iterative systems theory, and... Read more
Key finding: Presented empirical evidence from a four-year case study showing that informal, iterative processes dominate in temporary multi-organizations in construction projects, overshadowing linear processes; identified how such... Read more
Key finding: Developed a static, top-down method and a corresponding language specification for constructing iterative programs by defining results through intermediate sequences; formalized syntax and algebraic semantics facilitating... Read more
Key finding: Analyzed traditional software development methods to identify key barriers to optimization (specification, communication, optimization), and proposed an iterative-cyclic process model emphasizing participative development and... Read more