580 California St., Suite 400
San Francisco, CA, 94104
Key research themes
1. How can Newman’s theory systematically classify and analyze student errors in solving fundamental counting problems?
This theme focuses on the application of Newman's error analysis framework to identify, categorize, and understand specific types of errors students make when solving problems involving the fundamental counting principle, permutations, and combinations. Recognizing these error patterns informs instructional strategies to address conceptual and procedural misunderstandings in discrete mathematics education.
Key finding: The study applied Newman's five error indicators—reading, comprehension, transformation, process skills, and encoding errors—to analyze Informatics Engineering students' mistakes on fundamental counting problems. It found... Read more
Key finding: Although focused on word problems broadly, this study revealed that more than 80% of students' errors occurred before calculations, primarily in comprehension and reading stages, aligning with Newman's framework. It... Read more
Key finding: While this work does not provide detailed textual content here, Clarkson's research is critical in establishing the theory that errors in children's mathematical problem-solving, such as counting, are systematic rather than... Read more
2. What are the mathematical frameworks and iterative methods for error estimation and convergence analysis in solving nonlinear and least squares problems, including the context of Newman-type iterative algorithms?
This theme covers the mathematical modeling and convergence properties of iterative computational methods—such as Gauss-Newton-Kurchatov methods, two-step Newton methods, and conjugate gradient approaches—in nonlinear least squares and inverse problems. It investigates theoretical error bounds, convergence conditions under Lipschitz-type hypotheses, and computational schemes which avoid or analyze saddle points. These analyses are essential for reliable numerical solutions in applied mathematics and engineering.
Key finding: The paper proves tighter and more general local convergence results for the Gauss-Newton-Kurchatov iterative method applied to nonlinear least squares problems decomposed into differentiable and nondifferentiable parts. It... Read more
Key finding: This work delivers new sufficient conditions for semilocal convergence of the two-step Newton method using majorizing functions under generalized Lipschitz-type hypotheses, characterizing sequences that guarantee fourth-order... Read more
Key finding: The paper revisits classical error norm identities for the conjugate gradient (CG) method and establishes that lower bounds for the A-norm of the error remain reliable in finite precision arithmetic until the limit of... Read more
Key finding: Using an alternating iterative algorithm (a Newman-type method) for completing Cauchy data in solving inverse Robin boundary coefficient problems governed by Laplace’s equation, this numerical study applies an augmented... Read more
Key finding: This paper employs precise parameter estimation techniques characterized by nonlinear least squares and iterative methods in high-energy physics to estimate CP-violation parameters in meson decay processes. These computations... Read more
3. How does the Newman-Janis algorithm facilitate the generation and analysis of rotating black hole solutions, including their thermodynamic properties and quantum corrections?
This theme explores the Newman-Janis algorithm as a complex coordinate transformation technique to generate rotating black hole metrics from static solutions, enabling the study of physical properties such as event horizon structure, Hawking temperature, and quantum-corrected thermodynamics including those influenced by generalized uncertainty principles. These analyses are pivotal for understanding black hole stability, entropy corrections, and quantum gravity effects in modified gravity theories.
Key finding: This work applies the Newman-Janis algorithm to construct a rotating Einstein-nonlinear-Maxwell-Yukawa black hole solution. It analyzes the impact of the induced spin parameter on the Hawking temperature and derives... Read more
Key finding: By implementing the Newman-Janis transformation on regular black holes with cosmic string structures, this study examines modified Hawking temperatures and their quantum corrections incorporating generalized uncertainty... Read more
Key finding: Though not directly about black holes, this paper utilizes the 2nd-BERRU-PM methodology, which rigorously reduces uncertainties in computational physics models via joint phase-space of parameters and responses, enabling... Read more
Key finding: Continuing from the first part, this article shows uncertainty reduction and calibration when experimental data appear inconsistent with model predictions. The 2nd-BERRU-PM framework’s accommodation of higher-order... Read more