Paper: arXiv 2402.04138
Authors: Javier Cabello Sánchez, Juan Antonio Fernández Torvisco, Mariano R. Arias
Abstract
There are a couple of purposes in this paper: to study a problem of approximation with exponential functions and to show its relevance for the economic science. We present results that completely solve the problem of the best approximation by means of exponential functions and we will be able to determine what kind of data is suitable to be fitted. Data will be approximated using TAC (implemented in the R-package nlstac), a numerical algorithm for fitting data by exponential patterns without initial guess designed by the authors. We check one more time the robustness of this algorithm by successfully applying it to two very distant areas of economy: demand curves and nonlinear time series. This shows TAC’s utility and highlights how far this algorithm could be used.
Complexity vs Empirical Score
- Math Complexity: 8.0/10
- Empirical Rigor: 6.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper involves advanced mathematical analysis of exponential approximation with specific theorems and notation (high math), and it demonstrates the algorithm’s robustness using R package implementation and real-world economic data examples (moderate empirical rigor).
Research Flowchart
flowchart TD
A["Research Goal<br>Best approximation<br>by exponential functions"] --> B{"Select Domain"};
B --> C["Methodology<br>TAC Algorithm via R package nlstac<br>No initial guess needed"];
B --> D["Data Inputs<br>Economic &<br>Financial Datasets"];
C --> E{"Apply TAC Process<br>Iterative numerical fitting"};
D --> E;
E --> F{"Convergence Check"};
F -->|"Yes"| G["Outcomes<br>Robust Parameter Estimation<br>Validated across:<br>Demand Curves & Nonlinear Time Series"];
F -->|"No"| E;
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes TAC, a numerical algorithm (implemented in the R‑package nlstac) for fitting data by exponential patterns without an initial guess.
Source sentence
Data will be approximated using TAC (implemented in the R-package nlstac), a numerical algorithm for fitting data by exponential patterns without initial guess designed by the authors.
Assumes 2
- Every dataset must contain at least four data points to be considered for exponential approximation. data
Source sentence
Our main results show that every dataset (t, T), with at least four data, fulfils one of the following conditions:
- The dataset must be admissible (i.e., satisfy the conditions of Definition 1) for the best approximation to be an exponential. model
Source sentence
Let (t, T) be admissible. Then, the best approximation is a exponential if and only if ♠does not happen.
Data
- Demand curves other unknown
Source sentence
We check one more time the robustness of this algorithm by successfully applying it to two very distant areas of economy: demand curves and nonlinear time series.
- Nonlinear time series other unknown
Source sentence
We check one more time the robustness of this algorithm by successfully applying it to two very distant areas of economy: demand curves and nonlinear time series.
- Newton’s law of cooling experimental records synthetic unknown
Source sentence
We implemented an algorithm to fit, by a pattern as (11), and taking the max-norm as the approximation criteria, the records obtained by the device.
Costs
Not applicable
Finds 2
- The TAC algorithm successfully finds the best exponential approximation for datasets meeting the stated conditions. theoretical
Source sentence
We present results that completely solve the problem of the best approximation by means of exponential functions and we will be able to determine what kind of data is suitable to be fitted.
- Implementation of TAC on the Newton cooling example yields parameter estimates and CPU times shown in Table 1. performance
Source sentence
The results corresponding to this implementation are gathered in Table 1.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 10 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.