{"id":"20b98ebf-0ff1-4a2f-aaa6-9066af2cee53","arxiv_id":"2411.13524","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A collocation method based on incomplete even and odd trigonometric splines is developed for first boundary value problems of linear ODEs and illustrated on three examples.","lead":"The authors build approximate solutions to second-order linear boundary value problems using specially designed even and odd trigonometric splines together with a collocation method. The work offers a numerical-analytical tool for problems where exact solutions are difficult to find.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The odd-spline construction in Eq. (21) is underdetermined as printed: with N unknowns and collocation equations only for j=2,...,N-1, Example 3 cannot be reproduced from the stated method, so the central claim for method (b) is not yet supported.","rationale":"The reader's weakest assumption concerns the correctness of the self-cited fundamental spline formulas; that is a legitimate unverified dependency. However, the more immediate and checkable problem is that the odd-spline method, as specified by Eq. (21), does not have a well-defined linear system: N unknowns are matched with N-2 collocation equations. This is an internal specification issue rather than a disagreement with external consensus, and it directly affects the only numerical evidence for method (b). The paired-spline case (a), by contrast, is internally coherent: Eq. (19) has N-2 unknowns and N-2 equations. I therefore do not reject the paper; I regard it as conditionally acceptable pending a corrected statement of Eq. (21) and a report of N for the examples. The proposed test settles the ambiguity by direct computation of the rank of the system and by checking whether the reported errors correspond to the printed equations or to some implicit additional condition.","tokens_in":10439,"tokens_out":9385,"duration_ms":97367,"concrete_test":"Implement Eq. (21) exactly as printed for Example 3 with N=10 and r=4: form the coefficient matrix with rows j=2,...,N-1 and columns k=1,...,N, and compute its rank and nullity. If the nullity is at least 2, the system is underdetermined; compare the reported maximum error 0.00105 with the minimum-norm solution and with a generic particular solution. If the reported error is reproduced only after adding the equations j=1 and j=N, then the paper should explicitly correct the range of j. As a complementary check, rerun Example 3 with the intended N equations for N=5,10,20,40 and verify that the errors are stable and converge.","verdict_should_be":"UNCHANGED","load_bearing_attack":"For case (b), the solution is sought in form (18), u*(x) = sum_{k=1}^N alpha_k sts^(0)(r,q,k,x). Because each odd fundamental spline vanishes at 0 and pi, the boundary conditions (20) are satisfied automatically and none of the alpha_k are fixed by boundary data. The paper then states system (21) for j=2,3,...,N-1, i.e., N-2 equations for N unknowns. The immediately following text says the alpha_k for k=1,...,N are found, which would require N equations. Either the stated range of j is a typo (likely j=1,...,N), or the odd-spline method as written is underdetermined and admits infinitely many approximate solutions. Example 3, with reported maximum deviations 0.00157, 0.00105, 0.00098, 0.0005, and 0.00063, is the only numerical support for this method, so the central claim depends on resolving this ambiguity. In addition, the paper never reports the grid size N used in the examples, only r, so even the paired-spline results cannot be independently reproduced from the text.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a collocation method for the first boundary value problem for second-order linear ODEs, using 'incomplete' even and odd fundamental trigonometric splines introduced in the authors' earlier work [8]. The approximate solution is written as a linear combination of fundamental splines (Eqs. 16-18), the coefficients are determined by collocation at prescribed interior grid points, and the resulting linear systems are given as Eqs. (19) and (21). Three numerical examples are presented: Examples 1 and 2 use even ('paired') splines, and Example 3 uses odd splines, with reported maximum deviations of order 0.04-0.05 for Examples 1-2 and 0.0005-0.0016 for Example 3. The paper concludes that the method is developed and that the error depends on the spline order r, but it provides no convergence proof, no nonsingularity analysis for the collocation systems, and a number of technical details are imported directly from reference [8].","tokens_in":10631,"tokens_out":5801,"duration_ms":57563,"significance":"If the method works as intended, it would be a modest but useful extension of spline-collocation techniques to non-polynomial (trigonometric) spline bases, potentially beneficial for problems with oscillatory or periodic features. The paper's main positive aspects are the clear conceptual framework (using fundamental splines so that boundary conditions can be imposed directly on coefficients) and the inclusion of three worked examples with explicit numerical errors. However, the current manuscript does not provide the rigor expected for a numerical-analysis paper: there is no theorem stating convergence or even well-posedness of the algebraic systems, and the supporting evidence rests entirely on a few smooth test problems. The most serious problems are that the odd-spline collocation system (21) is underdetermined as written and the exact solution in Example 3 does not satisfy the stated boundary value problem, so the central claim for method (b) is not yet supported. The paper would also benefit from reporting all discretization parameters (grid size, truncation of infinite series) so the examples can be reproduced.","major_comments":[{"comment":"The system (21) is written for j=2,...,N-1, i.e., N-2 equations for N unknowns alpha_1,...,alpha_N. Since the odd fundamental splines vanish at x=0 and x=pi, the boundary conditions (20) are satisfied identically and do not determine any alpha_k. The text states that the values alpha_k for k=1,...,N are found, which would require N equations. If the intended range is j=1,...,N (all nodes of the grid (0)_3N, which are all interior), then the displayed range is a typo; otherwise method (b) is underdetermined and admits infinitely many approximate solutions. As printed, Example 3 cannot be reproduced from the stated algorithm, so this is a load-bearing defect in the central claim for method (b).","section":"Eq. (21)"},{"comment":"In Example 3, the stated exact solution u(x) = -sin(x)/sin(1) satisfies u''+u = 0, not u''+u = -x as required by the displayed differential equation. Moreover, if the parenthetical domain is [0,1], then u(1) = -1, which contradicts the boundary condition u(1)=0; if the domain is [0,pi], the boundary condition u(pi)=0 holds but the equation is still not satisfied. Therefore the reported maximum deviations (0.00157, 0.00105, 0.00098, 0.0005, 0.00063) compare the approximate solution to a function that is not a solution of the stated boundary value problem. Example 3 must be corrected before it can support the odd-spline method.","section":"Example 3"},{"comment":"The fundamental even and odd spline formulas are quoted from reference [8] without proof or independent verification, and the claims that these functions satisfy the Kronecker-delta interpolation property and belong to C^{r-1}[0,pi] are asserted rather than demonstrated. Every entry of the collocation systems (19) and (21) depends on these properties, so their validity is load-bearing. The paper should either provide a self-contained proof (or at least a precise statement of the relevant theorem from [8]) or clearly state these properties as assumptions together with a specific reference to the theorem.","section":"Equations (8)-(10) and (11)-(13)"},{"comment":"For none of the examples does the paper report the grid size N or the truncation parameters used when evaluating the infinite series in (8)-(10). Without this information, the reported maximum deviations (0.048, 0.044, 0.042 for Example 1; 0.048, 0.045, 0.043 for Example 2) are not reproducible from the manuscript alone. In addition, no condition numbers or convergence rates are given, so it is unclear whether the examples are representative of the method's behavior.","section":"Examples 1-2"}],"minor_comments":[{"comment":"The index range 'k=2,2,...,N-1' should read 'k=2,3,...,N-1'.","section":"Eq. (16)"},{"comment":"The independent variable is denoted t in the spline formulas (8)-(10) but x in the approximate solution (16)-(18); the domain of t and x should be stated consistently.","section":"Equations (8)-(10) and (16)-(18)"},{"comment":"The text introducing the splines (10) concerns the grid (1)_3N, but the caption of Figure 3 says the vertical lines coincide with the nodes of the grid (0)_3N; this inconsistency should be corrected.","section":"Figure 3"},{"comment":"The abstract states that 'theoretical positions are illustrated by numerical examples', but no theorem is stated; a precise convergence or error-bound statement would be more informative.","section":"Abstract"},{"comment":"Several displayed equations (e.g., (8)-(10)) contain OCR-related artifacts and misaligned summation limits, which make them difficult to follow; a careful typesetting revision is needed.","section":"General typesetting"}],"recommendation":"major_revision","confidential_remarks":"The paper is a short note that relies heavily on the authors' prior work [8]; the novelty over that reference is incremental and would be strengthened by a clear statement of what is new here beyond applying [8] to boundary value problems. The underdetermined system (21) and the incorrect exact solution in Example 3 are serious technical issues that must be fixed before the paper can be considered for publication. If the authors can correct these points and add the missing numerical details (N, truncation parameters, condition numbers), the paper might become an acceptable contribution to the spline-collocation literature, but in its current form the central claim for method (b) is unsupported."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the paper extends the authors' earlier trigonometric spline bases to a collocation scheme for one-dimensional second-order boundary value problems. The paired-spline branch (method a) is coherent and the examples behave. The odd-spline branch (method b) is not reproducible as printed: Eq. (21) states collocation equations for j=2,...,N-1, which is N-2 equations for N unknowns, so the reported Example 3 cannot be generated from the stated method unless the index range is a typo. That is the main thing you should know.\n\nWhat is actually here: a natural next step from the authors' previous work. The basis functions make boundary conditions easy to enforce, and the interpolation parameters are nodal values, which is a reasonable design. The examples are honest in one important sense: the accuracy is measured against exact solutions, so the validation is not circular. The basis formulas are imported from [7] and [8], which is acceptable if those papers are solid, but the current paper does not verify any of those properties.\n\nSoft spots, in proportion. The underdetermined system is load-bearing; the central claim for the odd-spline method depends on resolving it. The paper also never reports the grid size N used in the examples, only the order r, so the numerical results cannot be independently reproduced. There is no convergence proof, no nonsingularity argument for the collocation matrices, and no comparison against standard solvers. The text is OCR-garbled in places, which makes checking the formulas harder. These are all fixable. The method is plausible, the errors on smooth problems are small, and the authors admit further research is needed.\n\nWho this is for: numerical analysts interested in spline collocation and trigonometric spline bases. A serious referee should see it, but the revision must correct the equation range in (21), report N, and add at least a heuristic error discussion.","headline":"Odd-spline collocation as printed is underdetermined, but the paired-spline method is plausible and worth a revision round.","tokens_in":11171,"tokens_out":4103,"would_cite":false,"duration_ms":39649,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65L10","65L60","41A15","34B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper develops a collocation method for the first boundary value problem of second-order linear differential equations, using incomplete even and odd trigonometric splines as approximating functions.","keywords":["fundamental trigonometric splines","incomplete trigonometric splines","even fundamental splines","odd fundamental splines","boundary value problems","linear differential equations","collocation method"],"falsifier":"Build the collocation matrix (19) for a small test problem, say Example 3 with r=3 and N=2, and test whether the matrix is invertible and whether each fundamental spline takes value 1 at its own node and 0 at the others; if the matrix is singular or the interpolation condition fails, the construction has no solution.","tokens_in":10205,"feed_emoji":"📐","tokens_out":5054,"duration_ms":45194,"temperature":0.7,"pith_summary":"The paper develops a collocation method for the first boundary value problem of second-order linear differential equations, using incomplete even and odd trigonometric splines as approximating functions. The approximate solution is written as a combination of fundamental splines whose parameters are the solution values at grid nodes; substituting this into the equation and requiring zero residual at interior nodes yields a linear system. The method is illustrated on three test problems, with maximum deviations from the exact solution reported between 0.048 and 0.0005. The authors conclude that odd splines are well suited to zero boundary conditions and that even splines suit zero first-derivative conditions, with accuracy depending on the spline order r.","feed_headline":"Even and odd trig splines approximate boundary value solutions","feed_subtitle":"Collocation with fundamental splines yields maximum deviations between 0.048 and 0.0005 in test problems.","key_machinery":"The central objects are the fundamental even and odd trigonometric splines defined in equations (8)-(10) as infinite series with convergence factors σ(r-1, j). They are said to interpolate the grid values and to belong to $C^{{r-1}}$[0, π], which lets them be differentiated enough times to be substituted into a second-order equation. The spline interpolants (11)-(13) turn boundary conditions into direct assignments to the endpoint parameters, and collocation reduces the problem to a square linear algebraic system for the interior parameters.","core_discovery":"On the paper's own terms, the central claim is that approximate solutions of the first boundary value problem (14)-(15) can be constructed as linear combinations of the fundamental even and odd trigonometric splines from earlier work [8], with nodal solution values as parameters. Three constructions are given: even splines on the grid Δ2_N^(0), odd splines on Δ3_N^(0), and odd splines on Δ3_N^(1). Boundary conditions fix some parameters directly; the remaining ones are found from the collocation systems (19) or (21). The numerical examples show that these approximate solutions stay close to the exact solutions, with reported maximum errors of about 0.048, 0.044, 0.042, 0.048, 0.045, 0.043, 0.00157, 0.00105, 0.00098, 0.0005, and 0.00063 depending on the example and spline order.","pith_inferences":["If the interpolation property of these fundamental splines holds generally, the same collocation framework could be extended to higher-order differential equations or to systems by using tensor products of spline bases.","The reported errors suggest that odd splines on zero-boundary problems may be significantly more accurate than even splines; a systematic comparison on the same problem would make this quantitative.","A convergence proof, with error estimates as N grows for fixed r, is a natural next step; the paper only reports numerical behavior.","For oscillatory solutions, trigonometric splines might need fewer degrees of freedom than polynomial splines, but the paper does not test this."],"forward_implications":["A user can apply the method to any linear second-order boundary value problem by mapping [a,b] to [0,π]; the endpoint conditions become the first and last spline parameters.","Even splines should be used when the solution's first derivative vanishes at both endpoints, since the construction automatically enforces that extra condition.","Odd splines are recommended for zero boundary conditions, because they vanish at 0 and π by construction.","The error varies with the spline order r, so the examples indicate that order can be tuned to improve accuracy, though the paper does not give a general rule."],"supporting_citations":[{"why":"Supplies the formulas for the even and odd fundamental trigonometric splines used throughout the construction.","marker":"[8]"},{"why":"Defines the fundamental-function interpolation condition (7) that the spline basis must satisfy.","marker":"[9]"},{"why":"Introduces the classes of trigonometric splines that this paper builds on.","marker":"[6]"},{"why":"Establishes the smoothness and approximation properties of these trigonometric splines.","marker":"[7]"},{"why":"Describes the collocation method used to determine the spline parameters.","marker":"[3]"},{"why":"Surveys spline collocation methods for differential equations, the background that the paper extends.","marker":"[5]"},{"why":"States the first boundary value problem theory that defines the equations being solved.","marker":"[2]"}],"fun_headline_variants":["Even and odd trig splines close to exact ODE solutions","Collocation with trig splines yields errors down to 0.0005","Incomplete trig splines approximate boundary value problems","Trig spline collocation solves second-order linear BVPs","Odd and even splines: errors as low as 0.0005"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The method stands on the unproved assertion, inherited from the authors' earlier paper, that the fundamental even and odd trigonometric splines really do interpolate the chosen grid values and are smooth enough to differentiate as required.","fun_headline_variants_meta":{"raw":{"variants":["Even and odd trig splines close to exact ODE solutions","Collocation with trig splines yields errors down to 0.0005","Incomplete trig splines approximate boundary value problems","Trig spline collocation solves second-order linear BVPs","Odd and even splines: errors as low as 0.0005"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000931,"raw_usage":{"total_tokens":3896,"prompt_tokens":765,"completion_tokens":3131,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":381,"completion_tokens_details":{"reasoning_tokens":3043}},"tokens_in":381,"tokens_out":3131,"duration_ms":26828,"temperature":1.0,"reasoning_tokens":3043,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T16:17:25.223803+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Build the collocation matrix (19) for a small test problem, say Example 3 with r=3 and N=2, and test whether the matrix is invertible and whether each fundamental spline takes value 1 at its own node and 0 at the others; if the matrix is singular or the interpolation condition fails, the construction has no solution.","supporting_citations":[{"cited_title":"Forms of representation of interpolation trigonometric splines","cited_arxiv_id":"2407.19275","evidence_quote":"Supplies the formulas for the even and odd fundamental trigonometric splines used throughout the construction."},{"cited_title":"S., Kudryavtsev L.D., Levitan B.M","cited_arxiv_id":null,"evidence_quote":"Defines the fundamental-function interpolation condition (7) that the spline basis must satisfy."},{"cited_title":"Generalized Trigonometric Functions and Their Applications // IOSR Journal of Mathematics (IOSR-JM)","cited_arxiv_id":null,"evidence_quote":"Introduces the classes of trigonometric splines that this paper builds on."},{"cited_title":"Polynomial and trigonometric splines","cited_arxiv_id":"2110.04781","evidence_quote":"Establishes the smoothness and approximation properties of these trigonometric splines."},{"cited_title":"Computational Galerkin Methods // Springer-Verlag New York Berlin Heidelberg Tokyo, 1984","cited_arxiv_id":null,"evidence_quote":"Describes the collocation method used to determine the spline parameters."},{"cited_title":"A survey of spline collocation methods for the numerical soluti on of differential equations","cited_arxiv_id":null,"evidence_quote":"Surveys spline collocation methods for differential equations, the background that the paper extends."},{"cited_title":"Differential Equations and the Calculus of Variations","cited_arxiv_id":null,"evidence_quote":"States the first boundary value problem theory that defines the equations being solved."}],"review_version":1}