RustedSciThe 0.3.31

Rust framework for symbolic and numerical computing written under the influence of SciPy and Sympy:symbolic calculations,nonlinear systems,IVP and BVP,optimization,fitting,etc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
//! # Universal ODE Solver API
//!
//! This module provides a unified interface for solving ordinary differential equations (ODEs)
//! using different numerical methods. It supports both stiff and non-stiff problems.
//!
//! ## Supported Solvers
//!
//! ### Non-stiff Methods (for smooth, non-stiff problems)
//! - **RK45**: 4th-order Runge-Kutta method with adaptive step size
//! - **DOPRI**: Dormand-Prince method (high-order explicit)
//! - **AB4**: Adams-Bashforth 4th order method
//!
//! ### Stiff Methods (for stiff/implicit problems)
//! - **Radau**: Implicit Runge-Kutta method (Order 3, 5, or 7)
//! - **BDF**: Backward Differentiation Formula (variable order)
//! - **Backward Euler**: Simple implicit method
//!
//! ## Quick Start Guide
//!
//! ### Step 1: Define your ODE system
//! ```rust, ignore
//! use RustedSciThe::symbolic::symbolic_engine::Expr;
//! use nalgebra::DVector;
//!
//! // Example: y' = -2*y + sin(t), y(0) = 1
//! let eq1 = Expr::parse_expression("-2*y + sin(t)");
//! let eq_system = vec![eq1];
//! let values = vec!["y".to_string()];
//! let arg = "t".to_string();
//! let t0 = 0.0;
//! let y0 = DVector::from_vec(vec![1.0]);
//! let t_bound = 5.0;
//! ```
//!
//! ### Step 2: Choose and create a solver
//!
//! #### For non-stiff problems (smooth solutions):
//! ```rust, ignore
//! use RustedSciThe::numerical::ODE_api2::UniversalODESolver;
//!
//! // RK45 - good general purpose solver
//! let mut solver = UniversalODESolver::rk45(
//!     eq_system, values, arg, t0, y0, t_bound, 1e-4 // step_size
//! );
//!
//! // DOPRI - high accuracy explicit method
//! let mut solver = UniversalODESolver::dopri(
//!     eq_system, values, arg, t0, y0, t_bound, 1e-4
//! );
//! ```
//!
//! #### For stiff problems (rapid changes, chemical kinetics, etc.):
//! ```rust, ignore
//! use RustedSciThe::numerical::Radau::Radau_main::RadauOrder;
//!
//! // BDF - best for very stiff problems
//! let mut solver = UniversalODESolver::bdf(
//!     eq_system, values, arg, t0, y0, t_bound,
//!     1e-3, // max_step
//!     1e-6, // rtol
//!     1e-8  // atol
//! );
//!
//! // Radau - high-order implicit method
//! let mut solver = UniversalODESolver::radau(
//!     eq_system, values, arg, RadauOrder::Order5, t0, y0, t_bound,
//!     1e-6, // tolerance
//!     50,   // max_iterations
//!     Some(1e-3) // step_size (optional)
//! );
//! ```
//!
//! ### Step 3: Solve and get results
//! ```rust, ignore
//! solver.solve();
//! let (t_result, y_result) = solver.get_result();
//!
//! // Plot results
//! solver.plot_result();
//!
//! // Save to file (if supported)
//! solver.save_result().unwrap();
//! ```
//!
//! ## Advanced Usage
//!
//! ### Custom parameters for specific solvers:
//! ```rust, ignore
//! use RustedSciThe::numerical::ODE_api2::{UniversalODESolver, SolverType};
//!
//! let mut solver = UniversalODESolver::new(
//!     eq_system, values, arg, SolverType::Radau(RadauOrder::Order3),
//!     t0, y0, t_bound
//! );
//!
//! // Set Radau-specific parameters
//!
//! solver.set_tolerance(1e-8);
//! solver.set_parallel(true);  // Enable parallel processing
//! solver.set_max_iterations(100);
//!
//! solver.solve();
//! ```
//!
//! ## Solver Selection Guide
//!
//! | Problem Type | Recommended Solver | When to Use |
//! |--------------|-------------------|-------------|
//! | Smooth, non-stiff | RK45 or DOPRI | General purpose, oscillatory systems |
//! | Mildly stiff | Backward Euler | Simple implicit problems |
//! | Very stiff | BDF | Chemical kinetics, fast transients |
//! | High accuracy needed | Radau Order5/7 | Precision-critical applications |
//! | Large systems | BDF with sparse | Many variables, sparse Jacobian |
//!
//! ## System of Equations Example
//! ```rust, ignore
//! // System: y1' = -2*y1 + y2, y2' = y1 - 2*y2
//! RustedSciThe::numerical::ODE_api2::UniversalODESolver;
//! use nalgebra::{DMatrix, DVector};
//! let eq1 = Expr::parse_expression("-2*y1 + y2");
//! let eq2 = Expr::parse_expression("y1 - 2*y2");
//! let eq_system = vec![eq1, eq2];
//! let values = vec!["y1".to_string(), "y2".to_string()];
//! let y0 = DVector::from_vec(vec![1.0, 0.0]);
//!
//! let mut solver = UniversalODESolver::rk45(
//!     eq_system, values, "t".to_string(), 0.0, y0, 10.0, 1e-4
//! );
//! solver.solve();
//! ```
//! NB! tolerance handling for stop conditions
//!  tolerance handling:
//!
//! NonStiff methods (RK45, DOPRI, AB4): Use set_neighborhood_check() for custom tolerance
//!
//!BE (Backward Euler): Use set_neighborhood_check() for custom tolerance
//!
//!Radau: Uses its own tolerance parameter automatically
//!
//! BDF: Uses its own atol parameter automatically
use crate::symbolic::symbolic_engine::Expr;
use nalgebra::{DMatrix, DVector};
use std::collections::HashMap;

// Import all solver types
use crate::numerical::BDF::BDF_api::ODEsolver as BDFSolver;
use crate::numerical::BE::BE;
use crate::numerical::NonStiff_api::nonstiffODE;
use crate::numerical::Radau::Radau_main::{Radau, RadauOrder};

/// Universal ODE solver that can handle all solver types
pub struct UniversalODESolver {
    // Common parameters
    eq_system: Vec<Expr>,
    values: Vec<String>,
    arg: String,
    t0: f64,
    y0: DVector<f64>,
    t_bound: f64,

    // Solver type and instance
    solver_type: SolverType,
    solver_instance: Option<SolverInstance>,

    // Results
    t_result: Option<DVector<f64>>,
    y_result: Option<DMatrix<f64>>,

    // Solver-specific parameters
    solver_params: HashMap<String, SolverParam>,

    // Stop condition
    stop_condition: Option<HashMap<String, f64>>,
}

/// Enum for different solver types
#[derive(Clone, Debug)]
pub enum SolverType {
    NonStiff(String), // RK45, DOPRI, AB4
    Radau(RadauOrder),
    BDF,
    BackwardEuler,
}

/// Enum for solver instances
pub enum SolverInstance {
    NonStiff(nonstiffODE),
    Radau(Radau),
    BDF(BDFSolver),
    BE(BE),
}

/// Enum for different parameter types
#[derive(Clone, Debug)]
pub enum SolverParam {
    Float(f64),
    Int(usize),
    Bool(bool),
    OptionalFloat(Option<f64>),
    OptionalInt(Option<usize>),
    OptionalMatrix(Option<DMatrix<f64>>),
}

impl UniversalODESolver {
    /// Create a new universal ODE solver
    pub fn new(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        solver_type: SolverType,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
    ) -> Self {
        UniversalODESolver {
            eq_system,
            values,
            arg,
            t0,
            y0,
            t_bound,
            solver_type,
            solver_instance: None,
            t_result: None,
            y_result: None,
            solver_params: HashMap::new(),
            stop_condition: None,
        }
    }

    /// Set solver-specific parameters
    pub fn set_parameter(&mut self, key: &str, value: SolverParam) {
        self.solver_params.insert(key.to_string(), value);
    }

    pub fn set_parameters(&mut self, params: HashMap<String, SolverParam>) {
        self.solver_params.extend(params);
    }

    /// Set step size (common parameter)
    pub fn set_step_size(&mut self, step: f64) {
        self.set_parameter("step_size", SolverParam::Float(step));
    }

    /// Set tolerance (for stiff solvers)
    pub fn set_tolerance(&mut self, tolerance: f64) {
        self.set_parameter("tolerance", SolverParam::Float(tolerance));
    }

    /// Set maximum iterations (for iterative solvers)
    pub fn set_max_iterations(&mut self, max_iter: usize) {
        self.set_parameter("max_iterations", SolverParam::Int(max_iter));
    }

    /// Set relative tolerance (for BDF)
    pub fn set_rtol(&mut self, rtol: f64) {
        self.set_parameter("rtol", SolverParam::Float(rtol));
    }

    /// Set absolute tolerance (for BDF)
    pub fn set_atol(&mut self, atol: f64) {
        self.set_parameter("atol", SolverParam::Float(atol));
    }

    /// Set maximum step size (for BDF)
    pub fn set_max_step(&mut self, max_step: f64) {
        self.set_parameter("max_step", SolverParam::Float(max_step));
    }

    /// Set first step (for BDF)
    pub fn set_first_step(&mut self, first_step: Option<f64>) {
        self.set_parameter("first_step", SolverParam::OptionalFloat(first_step));
    }

    /// Set vectorized flag (for BDF)
    pub fn set_vectorized(&mut self, vectorized: bool) {
        self.set_parameter("vectorized", SolverParam::Bool(vectorized));
    }

    /// Set Jacobian sparsity (for BDF)
    pub fn set_jac_sparsity(&mut self, jac_sparsity: Option<DMatrix<f64>>) {
        self.set_parameter("jac_sparsity", SolverParam::OptionalMatrix(jac_sparsity));
    }

    /// Set parallel processing (for Radau)
    pub fn set_parallel(&mut self, parallel: bool) {
        self.set_parameter("parallel", SolverParam::Bool(parallel));
    }

    /// Set stop condition for all solvers
    pub fn set_stop_condition(&mut self, stop_condition: HashMap<String, f64>) {
        self.stop_condition = Some(stop_condition);
    }

    /// Set neighborhood check tolerance (for NonStiff and BE solvers)
    pub fn set_neighborhood_check(&mut self, tolerance: f64) {
        self.set_parameter("neighborhood_check", SolverParam::Float(tolerance));
    }

    /// Initialize the solver based on type and parameters
    pub fn initialize(&mut self) {
        match &self.solver_type {
            SolverType::NonStiff(method) => {
                let step = self.get_float_param("step_size").unwrap_or(1e-3);

                let mut solver = nonstiffODE::new(
                    self.eq_system.clone(),
                    self.values.clone(),
                    self.arg.clone(),
                    method.clone(),
                    self.t0,
                    self.y0.clone(),
                    self.t_bound,
                    step,
                    None,
                );

                // Set stop condition and neighborhood check if specified
                if let Some(ref stop_cond) = self.stop_condition {
                    solver.set_stop_condition(stop_cond.clone());
                }
                if let Some(neighborhood_check) = self.get_float_param("neighborhood_check") {
                    solver.set_neighborhood_check(neighborhood_check);
                }

                solver.generate();
                self.solver_instance = Some(SolverInstance::NonStiff(solver));
            }

            SolverType::Radau(order) => {
                let mut solver = Radau::new(order.clone());

                let tolerance = self.get_float_param("tolerance").unwrap_or(1e-6);
                let max_iterations = self.get_int_param("max_iterations").unwrap_or(50);
                let step = self.get_optional_float_param("step_size");

                solver.set_initial(
                    self.eq_system.clone(),
                    self.values.clone(),
                    self.arg.clone(),
                    tolerance,
                    max_iterations,
                    step,
                    self.t0,
                    self.t_bound,
                    self.y0.clone(),
                );

                // Set parallel processing if specified
                if let Some(parallel) = self.get_bool_param("parallel") {
                    solver.set_parallel(parallel);
                }

                // Set stop condition if specified (Radau uses its own tolerance)
                if let Some(ref stop_cond) = self.stop_condition {
                    solver.set_stop_condition(stop_cond.clone());
                }

                self.solver_instance = Some(SolverInstance::Radau(solver));
            }

            SolverType::BDF => {
                let max_step = self.get_float_param("max_step").unwrap_or(1e-3);
                let rtol = self.get_float_param("rtol").unwrap_or(1e-5);
                let atol = self.get_float_param("atol").unwrap_or(1e-5);
                let vectorized = self.get_bool_param("vectorized").unwrap_or(false);
                let first_step = self.get_optional_float_param("first_step");
                let jac_sparsity = self.get_optional_matrix_param("jac_sparsity");
                //  println!("max step {}", max_step);
                // println!("params {:?}", self.solver_params);
                let mut solver = BDFSolver::new(
                    self.eq_system.clone(),
                    self.values.clone(),
                    self.arg.clone(),
                    "BDF".to_string(),
                    self.t0,
                    self.y0.clone(),
                    self.t_bound,
                    max_step,
                    rtol,
                    atol,
                    jac_sparsity,
                    vectorized,
                    first_step,
                );

                // Set stop condition if specified (BDF uses atol as tolerance)
                if let Some(ref stop_cond) = self.stop_condition {
                    solver.set_stop_condition(stop_cond.clone());
                }

                solver.generate();
                self.solver_instance = Some(SolverInstance::BDF(solver));
            }

            SolverType::BackwardEuler => {
                let mut solver = BE::new();

                let tolerance = self.get_float_param("tolerance").unwrap_or(1e-6);
                let max_iterations = self.get_int_param("max_iterations").unwrap_or(50);
                let step = self.get_optional_float_param("step_size");

                solver.set_initial(
                    self.eq_system.clone(),
                    self.values.clone(),
                    self.arg.clone(),
                    tolerance,
                    max_iterations,
                    step,
                    self.t0,
                    self.t_bound,
                    self.y0.clone(),
                );

                // Set stop condition and neighborhood check if specified
                if let Some(ref stop_cond) = self.stop_condition {
                    solver.set_stop_condition(stop_cond.clone());
                }
                if let Some(neighborhood_check) = self.get_float_param("neighborhood_check") {
                    solver.set_neighborhood_check(neighborhood_check);
                }

                self.solver_instance = Some(SolverInstance::BE(solver));
            }
        }
    }

    /// Solve the ODE system
    pub fn solve(&mut self) {
        if self.solver_instance.is_none() {
            self.initialize();
        }

        match self.solver_instance.as_mut().unwrap() {
            SolverInstance::NonStiff(solver) => {
                solver.solve();
                let (t_result, y_result) = solver.get_result();
                // let y_result = y_result.transpose();
                self.t_result = Some(t_result);
                self.y_result = Some(y_result);
            }

            SolverInstance::Radau(solver) => {
                solver.solve();
                let (t_result, y_result) = solver.get_result();
                self.t_result = t_result;
                self.y_result = y_result;
            }

            SolverInstance::BDF(solver) => {
                solver.solve();
                let (t_result, y_result) = solver.get_result();
                self.t_result = Some(t_result);
                self.y_result = Some(y_result);
            }

            SolverInstance::BE(solver) => {
                solver.solve();
                let (t_result, y_result) = solver.get_result();
                self.t_result = t_result;
                self.y_result = y_result;
            }
        }
    }

    /// Get results
    pub fn get_result(&self) -> (Option<DVector<f64>>, Option<DMatrix<f64>>) {
        (self.t_result.clone(), self.y_result.clone())
    }

    /// Get solver status
    pub fn get_status(&self) -> Option<String> {
        match self.solver_instance.as_ref()? {
            SolverInstance::NonStiff(solver) => Some(solver.get_status().clone()),
            SolverInstance::Radau(solver) => Some(solver.get_status().clone()),
            SolverInstance::BDF(solver) => Some(solver.get_status().clone()),
            SolverInstance::BE(solver) => Some(solver.get_status().clone()),
        }
    }

    /// Plot results
    pub fn plot_result(&self) {
        if let (Some(_t_result), Some(_y_result)) = (&self.t_result, &self.y_result) {
            match self.solver_instance.as_ref().unwrap() {
                SolverInstance::NonStiff(solver) => solver.plot_result(),
                SolverInstance::Radau(solver) => solver.plot_result(),
                SolverInstance::BDF(solver) => solver.plot_result(),
                SolverInstance::BE(solver) => solver.plot_result(),
            }
        }
    }

    /// Save results
    pub fn save_result(&self) -> Result<(), Box<dyn std::error::Error>> {
        match self.solver_instance.as_ref().unwrap() {
            SolverInstance::NonStiff(solver) => solver.save_result(),
            SolverInstance::BDF(solver) => solver.save_result(),
            _ => Ok(()), // Other solvers don't have save_result implemented
        }
    }

    // Helper methods for parameter extraction
    fn get_float_param(&self, key: &str) -> Option<f64> {
        match self.solver_params.get(key) {
            Some(SolverParam::Float(val)) => Some(*val),
            _ => None,
        }
    }

    fn get_int_param(&self, key: &str) -> Option<usize> {
        match self.solver_params.get(key) {
            Some(SolverParam::Int(val)) => Some(*val),
            _ => None,
        }
    }

    fn get_bool_param(&self, key: &str) -> Option<bool> {
        match self.solver_params.get(key) {
            Some(SolverParam::Bool(val)) => Some(*val),
            _ => None,
        }
    }

    fn get_optional_float_param(&self, key: &str) -> Option<f64> {
        match self.solver_params.get(key) {
            Some(SolverParam::OptionalFloat(val)) => *val,
            Some(SolverParam::Float(val)) => Some(*val),
            _ => None,
        }
    }

    fn get_optional_matrix_param(&self, key: &str) -> Option<DMatrix<f64>> {
        match self.solver_params.get(key) {
            Some(SolverParam::OptionalMatrix(val)) => val.clone(),
            _ => None,
        }
    }
}

/// Convenience functions for creating solvers
impl UniversalODESolver {
    /// Create RK45 solver
    pub fn rk45(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
        step_size: f64,
    ) -> Self {
        let mut solver = Self::new(
            eq_system,
            values,
            arg,
            SolverType::NonStiff("RK45".to_string()),
            t0,
            y0,
            t_bound,
        );
        solver.set_step_size(step_size);
        solver
    }

    /// Create DOPRI solver
    pub fn dopri(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
        step_size: f64,
    ) -> Self {
        let mut solver = Self::new(
            eq_system,
            values,
            arg,
            SolverType::NonStiff("DOPRI".to_string()),
            t0,
            y0,
            t_bound,
        );
        solver.set_step_size(step_size);
        solver
    }
    /// Create DOPRI solver
    pub fn ab4(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
        step_size: f64,
    ) -> Self {
        let mut solver = Self::new(
            eq_system,
            values,
            arg,
            SolverType::NonStiff("AB4".to_string()),
            t0,
            y0,
            t_bound,
        );
        solver.set_step_size(step_size);
        solver
    }

    /// Create Radau solver
    pub fn radau(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        order: RadauOrder,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
        tolerance: f64,
        max_iterations: usize,
        step_size: Option<f64>,
    ) -> Self {
        let mut solver = Self::new(
            eq_system,
            values,
            arg,
            SolverType::Radau(order),
            t0,
            y0,
            t_bound,
        );
        solver.set_tolerance(tolerance);
        solver.set_max_iterations(max_iterations);
        if let Some(step) = step_size {
            solver.set_step_size(step);
        }
        solver
    }

    /// Create BDF solver
    pub fn bdf(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
        max_step: f64,
        rtol: f64,
        atol: f64,
    ) -> Self {
        let mut solver = Self::new(eq_system, values, arg, SolverType::BDF, t0, y0, t_bound);
        solver.set_max_step(max_step);
        solver.set_rtol(rtol);
        solver.set_atol(atol);
        solver
    }

    /// Create Backward Euler solver
    pub fn backward_euler(
        eq_system: Vec<Expr>,
        values: Vec<String>,
        arg: String,
        t0: f64,
        y0: DVector<f64>,
        t_bound: f64,
        tolerance: f64,
        max_iterations: usize,
        step_size: Option<f64>,
    ) -> Self {
        let mut solver = Self::new(
            eq_system,
            values,
            arg,
            SolverType::BackwardEuler,
            t0,
            y0,
            t_bound,
        );
        solver.set_tolerance(tolerance);
        solver.set_max_iterations(max_iterations);
        if let Some(step) = step_size {
            solver.set_step_size(step);
        }
        solver
    }
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/// Tests
/// ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#[cfg(test)]
mod tests {
    use super::*;
    use approx::assert_relative_eq;
    use std::collections::HashMap;

    #[test]
    fn test_universal_rk45() {
        let eq1 = Expr::parse_expression("-y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 1.0;
        let step_size = 1e-4;

        let mut solver =
            UniversalODESolver::rk45(eq_system, values, arg, t0, y0, t_bound, step_size);

        solver.solve();
        let (t_result, y_result) = solver.get_result();

        assert!(t_result.is_some());
        assert!(y_result.is_some());

        let y_final = y_result.clone().unwrap()[(y_result.as_ref().unwrap().nrows() - 1, 0)];
        let expected = (-1.0_f64).exp();
        assert_relative_eq!(y_final, expected, epsilon = 1e-2);
    }
    #[test]
    fn test_rk45_exponential() {
        // y'' - y = 0,
        // y0' =y1,
        // y1' = y0
        // y(0) = 0 y'(0) = 1
        // solution y(x) = 1/2 (e^x - e^(-x))

        let eq_system = vec![Expr::parse_expression("y1"), Expr::parse_expression("y0")];
        let values = vec!["y0".to_string(), "y1".to_string()];
        let arg = "x".to_string();
        let t0 = 0.0;

        let y0 = DVector::from_vec(vec![0.0, 1.0]);
        let t_bound = 0.5;
        let step = 1e-3;
        let solver_type = SolverType::NonStiff("RK45".to_owned());
        let mut solver =
            UniversalODESolver::new(eq_system, values, arg, solver_type, t0, y0, t_bound);
        let mut params = HashMap::new();
        let add_step_size = HashMap::from([("step_size".to_string(), SolverParam::Float(step))]);
        params.extend(add_step_size);

        solver.set_parameters(params);
        solver.initialize();
        solver.solve();
        let (t_result, y_result) = solver.get_result();
        let y_final = y_result.clone().unwrap();
        let x_mesh = t_result.clone().unwrap();
        let y0: DVector<f64> = y_final.column(0).into();
        // println!("{:?}", y0);
        for i in 0..y0.len() {
            let y = y0[i];
            let x = x_mesh[i];
            let expected = 0.5 * (x.exp() - (-x).exp());
            assert_relative_eq!(y, expected, epsilon = 1e-4);
        }
    }
    #[test]
    fn test_ab4_cos() {
        // y'' + y = 0,
        // y0' =y1,
        // y1' =- y0
        // y(0) = 1, y'(0) = 0 (solution: y = cos(x))
        let eq_system = vec![Expr::parse_expression("y1"), Expr::parse_expression("-y0")];
        let values = vec!["y0".to_string(), "y1".to_string()];
        let arg = "x".to_string();
        let t0 = 0.0;
        // cos(0)=1, -sin(0)=0
        let y0 = DVector::from_vec(vec![1.0, 0.0]);
        let t_bound = std::f64::consts::PI;
        let step = 1e-5;
        let solver_type = SolverType::NonStiff("AB4".to_owned());
        let mut solver =
            UniversalODESolver::new(eq_system, values, arg, solver_type, t0, y0, t_bound);
        let mut params = HashMap::new();
        let add_step_size = HashMap::from([("step_size".to_string(), SolverParam::Float(step))]);
        params.extend(add_step_size);

        solver.set_parameters(params);
        solver.initialize();
        solver.solve();
        let (t_result, y_result) = solver.get_result();
        let y_final = y_result.clone().unwrap();
        let x_mesh = t_result.clone().unwrap();
        let y0: DVector<f64> = y_final.column(0).into();
        let y1: DVector<f64> = y_final.column(1).into();
        // println!("{:?} \n {:?}", y0, y1);
        for i in 0..y0.len() {
            let y = y0[i];
            let x = x_mesh[i];
            let expected = x.cos();
            let expected1 = -x.sin();
            assert_relative_eq!(y, expected, epsilon = 1e-4);
            assert_relative_eq!(y1[i], expected1, epsilon = 1e-4);
        }
    }
    #[test]
    fn test_rk45_cos2() {
        // y'' + y = 0,
        // y0' =y1,
        // y1' =- y0
        // y(0) = 1, y'(0) = 0 (solution: y = cos(x))
        let eq_system = vec![Expr::parse_expression("y1"), Expr::parse_expression("-y0")];
        let values = vec!["y0".to_string(), "y1".to_string()];
        let arg = "x".to_string();
        let t0 = 0.0;
        // cos(0)=1, -sin(0)=0
        let y0 = DVector::from_vec(vec![1.0, 0.0]);
        let t_bound = std::f64::consts::PI;
        let step = 1e-5;
        let solver_type = SolverType::NonStiff("RK45".to_owned());
        let mut solver =
            UniversalODESolver::new(eq_system, values, arg, solver_type, t0, y0, t_bound);
        let mut params = HashMap::new();
        let add_step_size = HashMap::from([("step_size".to_string(), SolverParam::Float(step))]);
        params.extend(add_step_size);

        solver.set_parameters(params);
        solver.initialize();
        solver.solve();
        let (t_result, y_result) = solver.get_result();
        let y_final = y_result.clone().unwrap();
        let x_mesh = t_result.clone().unwrap();
        let y0: DVector<f64> = y_final.column(0).into();
        let y1: DVector<f64> = y_final.column(1).into();
        // println!("{:?} \n {:?}", y0, y1);
        for i in 0..y0.len() {
            let y = y0[i];
            let x = x_mesh[i];
            let expected = x.cos();
            let expected1 = -x.sin();
            assert_relative_eq!(y, expected, epsilon = 1e-4);
            assert_relative_eq!(y1[i], expected1, epsilon = 1e-4);
        }
    }
    #[test]
    fn test_universal_radau() {
        let eq1 = Expr::parse_expression("-y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 0.5;

        let mut solver = UniversalODESolver::radau(
            eq_system,
            values,
            arg,
            RadauOrder::Order3,
            t0,
            y0,
            t_bound,
            1e-6,
            50,
            Some(1e-3),
        );

        solver.solve();
        let (t_result, y_result) = solver.get_result();

        assert!(t_result.is_some());
        assert!(y_result.is_some());
    }

    #[test]
    fn test_universal_bdf() {
        let eq1 = Expr::parse_expression("-y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 0.5;

        let mut solver =
            UniversalODESolver::bdf(eq_system, values, arg, t0, y0, t_bound, 1e-3, 1e-5, 1e-5);

        solver.solve();
        let (t_result, y_result) = solver.get_result();

        assert!(t_result.is_some());
        assert!(y_result.is_some());
    }
    #[test]
    fn test_bdf_exponential() {
        // y'' - y = 0,
        // y0' =y1,
        // y1' = y0
        // y(0) = 0 y' = 1
        // solution y(x) = 1/2 (e^x - e^(-x))

        let eq_system = vec![Expr::parse_expression("y1"), Expr::parse_expression("y0")];
        let values = vec!["y0".to_string(), "y1".to_string()];
        let arg = "x".to_string();
        let t0 = 0.0;

        let y0 = DVector::from_vec(vec![0.0, 1.0]);
        let t_bound = 0.5;

        let mut solver =
            UniversalODESolver::bdf(eq_system, values, arg, t0, y0, t_bound, 1e-3, 1e-5, 1e-5);

        solver.solve();
        let (t_result, y_result) = solver.get_result();
        let y_final = y_result.clone().unwrap();
        let x_mesh = t_result.clone().unwrap();
        let y0: DVector<f64> = y_final.column(0).into();
        // println!("{:?}", y0);
        for i in 0..y0.len() {
            let y = y0[i];
            let x = x_mesh[i];
            let expected = 0.5 * (x.exp() - (-x).exp());
            assert_relative_eq!(y, expected, epsilon = 1e-4);
        }
    }

    #[test]
    fn test_bdf_linear() {
        // y'' = 0, y(0) = 0, y(1) = 1 (solution: y = x)
        // y0' = y1
        // y1' = 0
        //
        let eq_vec = vec![Expr::parse_expression("y1"), Expr::parse_expression("0")];
        let values = vec!["y0".to_string(), "y1".to_string()];
        let arg = "x".to_string();

        let y0 = DVector::from_vec(vec![0.0, 0.9997384083916304]);
        let t0 = 0.0;
        let t_bound = 1.0;

        let mut solver =
            UniversalODESolver::bdf(eq_vec, values, arg, t0, y0, t_bound, 1e-3, 1e-5, 1e-5);

        solver.solve();
        let (t_result, y_result) = solver.get_result();
        let y_final = y_result.clone().unwrap();
        let x_mesh = t_result.clone().unwrap();
        let y0: DVector<f64> = y_final.column(0).into();
        // println!("{:?}", y0);
        for i in 0..y0.len() {
            let y = y0[i];
            let x = x_mesh[i];
            let expected = x;
            assert_relative_eq!(y, expected, epsilon = 1e-3);
        }
    }
    #[test]
    fn test_universal_backward_euler() {
        let eq1 = Expr::parse_expression("-y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 0.5;

        let mut solver = UniversalODESolver::backward_euler(
            eq_system,
            values,
            arg,
            t0,
            y0,
            t_bound,
            1e-6,
            50,
            Some(1e-3),
        );

        solver.solve();
        let (t_result, y_result) = solver.get_result();

        assert!(t_result.is_some());
        assert!(y_result.is_some());
    }
    #[test]
    fn test_direct_setting() {
        let eq1 = Expr::parse_expression("-y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 0.5;

        let mut solver = UniversalODESolver::new(
            eq_system,
            values,
            arg,
            SolverType::Radau(RadauOrder::Order3),
            t0,
            y0,
            t_bound,
        );
        solver.set_max_iterations(100);
        solver.set_tolerance(1e-6);
        solver.set_step_size(1e-3);
        solver.initialize();
        solver.solve();
        let (t_result, y_result) = solver.get_result();

        assert!(t_result.is_some());
        assert!(y_result.is_some());
    }

    #[test]
    fn test_universal_stop_condition_rk45() {
        // Test: y' = y, y(0) = 1, stop when y reaches 2.0
        let eq1 = Expr::parse_expression("y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 10.0; // Large bound to ensure stop condition triggers first
        let step_size = 0.01;

        let mut solver =
            UniversalODESolver::rk45(eq_system, values, arg, t0, y0, t_bound, step_size);

        let mut stop_condition = HashMap::new();
        stop_condition.insert("y".to_string(), 2.0);
        solver.set_stop_condition(stop_condition);
        solver.set_neighborhood_check(1e-2);

        solver.solve();

        assert_eq!(solver.get_status().unwrap(), "stopped_by_condition");
        let (_, y_result) = solver.get_result();
        let y_res = y_result.unwrap();
        let final_y = y_res[(y_res.nrows() - 1, 0)];
        assert!((final_y - 2.0).abs() <= 1e-2);
    }

    #[test]
    fn test_universal_stop_condition_radau() {
        // Test: y' = y, y(0) = 1, stop when y reaches 2.0
        let eq1 = Expr::parse_expression("y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 10.0;

        let mut solver = UniversalODESolver::radau(
            eq_system,
            values,
            arg,
            RadauOrder::Order3,
            t0,
            y0,
            t_bound,
            1e-2,
            50,
            Some(0.01),
        );

        let mut stop_condition = HashMap::new();
        stop_condition.insert("y".to_string(), 2.0);
        solver.set_stop_condition(stop_condition);

        solver.solve();

        assert_eq!(solver.get_status().unwrap(), "stopped_by_condition");
        let (_, y_result) = solver.get_result();
        let y_res = y_result.unwrap();
        let final_y = y_res[(y_res.nrows() - 1, 0)];
        assert!((final_y - 2.0).abs() <= 1e-2); // Uses Radau's tolerance
    }

    #[test]
    fn test_universal_stop_condition_bdf() {
        // Test: y' = y, y(0) = 1, stop when y reaches 2.0
        let eq1 = Expr::parse_expression("y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 10.0;

        let mut solver =
            UniversalODESolver::bdf(eq_system, values, arg, t0, y0, t_bound, 1e-3, 1e-5, 1e-3);

        let mut stop_condition = HashMap::new();
        stop_condition.insert("y".to_string(), 2.0);
        solver.set_stop_condition(stop_condition);

        solver.solve();

        assert_eq!(solver.get_status().unwrap(), "stopped_by_condition");
        let (_, y_result) = solver.get_result();
        let y_res = y_result.unwrap();
        let final_y = y_res[(y_res.nrows() - 1, 0)];
        assert!((final_y - 2.0).abs() <= 1e-2); // Uses BDF's atol
    }

    #[test]
    fn test_universal_stop_condition_be() {
        // Test: y' = y, y(0) = 1, stop when y reaches 1.5
        let eq1 = Expr::parse_expression("y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 10.0;

        let mut solver = UniversalODESolver::backward_euler(
            eq_system,
            values,
            arg,
            t0,
            y0,
            t_bound,
            1e-6,
            50,
            Some(0.01),
        );

        let mut stop_condition = HashMap::new();
        stop_condition.insert("y".to_string(), 1.5);
        solver.set_stop_condition(stop_condition);
        solver.set_neighborhood_check(1e-2);

        solver.solve();

        assert_eq!(solver.get_status().unwrap(), "stopped_by_condition");
        let (_, y_result) = solver.get_result();
        let y_res = y_result.unwrap();
        let final_y = y_res[(y_res.nrows() - 1, 0)];
        assert!((final_y - 1.5).abs() <= 1e-2);
    }

    #[test]
    fn test_universal_no_stop_condition() {
        // Test without stop condition - should run to t_bound
        let eq1 = Expr::parse_expression("-y");
        let eq_system = vec![eq1];
        let values = vec!["y".to_string()];
        let arg = "t".to_string();
        let t0 = 0.0;
        let y0 = DVector::from_vec(vec![1.0]);
        let t_bound = 1.0;
        let step_size = 0.1;

        let mut solver =
            UniversalODESolver::rk45(eq_system, values, arg, t0, y0, t_bound, step_size);

        solver.solve();

        assert_eq!(solver.get_status().unwrap(), "finished");
        let (t_result, _) = solver.get_result();
        let t_res = t_result.unwrap();
        let final_t = t_res[t_res.len() - 1];
        assert!((final_t - t_bound).abs() <= step_size);
    }
}