tests/test.sh exit code (0 → resolved); the classification below is post-hoc and cannot change it./opt/beamfd/src/solver.cpp
1 #include "beamfd/solver.hpp"
2
3 #include <cmath>
4 #include <cstddef>
5 #include <stdexcept>
6 #include <vector>
7
8 #include "beamfd/linalg.hpp"
9 #include "beamfd/types.hpp"
10
11 namespace beamfd {
12
13 // ============================================================================
14 // TODO(candidate): Implement the beam-bending finite-difference core.
15 //
16 // Two member functions below are stubs that currently return a zero deflection
17 // field and an empty/zero system, so every analysis is wrong and the grader
18 // fails. Replace the stub bodies of
19 //
20 // BeamSystem BeamSolver::assemble_system() const;
21 // BeamResult BeamSolver::solve() const;
22 //
23 // with correct implementations of the boundary-value problem specified in
24 // instruction.md. Do NOT change the public signatures declared in
25 // include/beamfd/solver.hpp, do NOT modify the recovery helpers below, and
26 // reuse the existing support layer (DenseMatrix, solve_general, and the Beam
27 // accessors EI_at / k_at / q_at / end_moment / applied_end_shear / left /
28 // right / dx / num_intervals / num_nodes / validate).
29 //
30 // The physics, the support and load semantics, the contract, and the I/O
31 // format are described in instruction.md. The required behaviour is enforced
32 // by a hidden grading suite (the shipped tests/ are only a smoke check); design
33 // a discretization that is at least second-order accurate and assemble the
34 // linear system A w = b for the nodal deflection, then solve it with
35 // solve_general. Call Beam::validate() at the start of solve() and let its
36 // exceptions (and any singular-system exception from solve_general) propagate.
37 // ============================================================================
38
39 BeamSystem BeamSolver::assemble_system() const {
40 // TODO(candidate): build and return the finite-difference system A w = b.
41 const std::size_t n = beam_.num_nodes();
42 BeamSystem sys;
43 sys.A = DenseMatrix(n, n); // all zeros -> singular / wrong
44 sys.b.assign(n, 0.0);
45 return sys;
46 }
47
48 BeamResult BeamSolver::solve() const {
49 // TODO(candidate): validate, assemble, solve, return the deflection field.
50 const std::size_t n = beam_.num_nodes();
51 BeamResult result;
52 result.deflection.assign(n, 0.0); // trivially zero -> wrong
53 return result;
54 }
55
56 // ----------------------------------------------------------------------------
57 // Recovery helpers (already implemented; do NOT modify). These differentiate a
58 // given deflection field so callers can recompute physical quantities (bending
59 // moment, shear) directly from a candidate result, honoring a variable EI(x).
60
61 namespace {
62
63 // Second derivative w''(x_i) by central difference (interior) / one-sided
64 // 2nd-order difference (ends).
65 double second_derivative(const std::vector<double>& w, std::size_t i, double h2) {
66 const std::size_t n = w.size();
67 if (i == 0) {
68 return (2.0 * w[0] - 5.0 * w[1] + 4.0 * w[2] - w[3]) / h2;
69 }
70 if (i == n - 1) {
71 return (2.0 * w[n - 1] - 5.0 * w[n - 2] + 4.0 * w[n - 3] - w[n - 4]) / h2;
72 }
73 return (w[i - 1] - 2.0 * w[i] + w[i + 1]) / h2;
74 }
75
76 } // namespace
77
78 std::vector<double> BeamSolver::bending_moment_field(
79 const std::vector<double>& w) const {
80 const std::size_t n = beam_.num_nodes();
81 if (w.size() != n) {
82 throw std::invalid_argument("bending_moment_field: deflection size mismatch");
83 }
84 const double h2 = beam_.dx() * beam_.dx();
85 std::vector<double> M(n, 0.0);
86 for (std::size_t i = 0; i < n; ++i) {
87 M[i] = beam_.EI_at(i) * second_derivative(w, i, h2);
88 }
89 return M;
90 }
91
92 std::vector<double> BeamSolver::shear_field(const std::vector<double>& w) const {
93 const std::size_t n = beam_.num_nodes();
94 if (w.size() != n) {
95 throw std::invalid_argument("shear_field: deflection size mismatch");
96 }
97 if (n < 5) {
98 throw std::invalid_argument("shear_field: need at least 5 nodes");
99 }
100 const double h = beam_.dx();
101 const double h2 = h * h;
102 std::vector<double> m(n, 0.0);
103 for (std::size_t j = 0; j < n; ++j) {
104 m[j] = beam_.EI_at(j) * second_derivative(w, j, h2);
105 }
106 std::vector<double> V(n, 0.0);
107 for (std::size_t i = 0; i < n; ++i) {
108 if (i == 0) {
109 V[i] = (-3.0 * m[0] + 4.0 * m[1] - m[2]) / (2.0 * h);
110 } else if (i == n - 1) {
111 V[i] = (3.0 * m[n - 1] - 4.0 * m[n - 2] + m[n - 3]) / (2.0 * h);
112 } else {
113 V[i] = (m[i + 1] - m[i - 1]) / (2.0 * h);
114 }
115 }
116 return V;
117 }
118
119 } // namespace beamfd
120
/opt/beamfd/include/beamfd/solver.hpp
1 #ifndef BEAMFD_SOLVER_HPP
2 #define BEAMFD_SOLVER_HPP
3
4 #include <cstddef>
5 #include <vector>
6
7 #include "beamfd/beam.hpp"
8 #include "beamfd/linalg.hpp"
9
10 namespace beamfd {
11
12 /// The assembled finite-difference linear system A w = b for a beam.
13 /// `A` has size num_nodes x num_nodes and `b` has length num_nodes; the
14 /// unknown w is the nodal transverse deflection field. Exposed so tests can
15 /// check the discrete equilibrium residual directly.
16 struct BeamSystem {
17 DenseMatrix A;
18 std::vector<double> b;
19 };
20
21 /// Result of a static beam-bending analysis.
22 struct BeamResult {
23 /// Nodal transverse deflection w_i [m], length == beam.num_nodes(),
24 /// ordered from x = 0 (i = 0) to x = L (i = num_intervals).
25 std::vector<double> deflection;
26 };
27
28 /// Static bending solver for an Euler-Bernoulli beam with (possibly) variable
29 /// flexural rigidity and an optional elastic foundation. The continuum
30 /// boundary-value problem and the support/load semantics are specified in
31 /// instruction.md; choosing and assembling a suitable finite-difference
32 /// discretization of it, and solving the resulting linear system, is the work
33 /// of this class.
34 class BeamSolver {
35 public:
36 explicit BeamSolver(const Beam& beam) : beam_(beam) {}
37
38 /// Run the full analysis. Calls Beam::validate() first and propagates any
39 /// exception it throws. Throws std::runtime_error if the assembled system
40 /// is singular.
41 BeamResult solve() const;
42
43 /// Assemble the finite-difference system A w = b. Exposed for testing and
44 /// reuse (the discrete equilibrium-residual invariant checks A w - b ~ 0 at
45 /// the interior nodes).
46 BeamSystem assemble_system() const;
47
48 // ---- Recovery helpers (fully implemented; operate on a deflection field).
49 // These let the caller recompute physical quantities directly from a
50 // candidate deflection vector, independent of how it was produced.
51
52 /// Bending moment M_i = EI(x_i) * w''(x_i) [N*m] via a central second
53 /// difference at interior nodes and a one-sided second difference at the
54 /// ends. `w` must have length num_nodes(). Throws std::invalid_argument
55 /// otherwise.
56 std::vector<double> bending_moment_field(const std::vector<double>& w) const;
57
58 /// Shear force V_i = (EI w'')'(x_i) [N] via finite differences of the
59 /// nodal bending moment. `w` must have length num_nodes(). Throws
60 /// std::invalid_argument otherwise.
61 std::vector<double> shear_field(const std::vector<double>& w) const;
62
63 private:
64 const Beam& beam_;
65 };
66
67 } // namespace beamfd
68
69 #endif // BEAMFD_SOLVER_HPP
70
/opt/beamfd/include/beamfd/beam.hpp
1 #ifndef BEAMFD_BEAM_HPP
2 #define BEAMFD_BEAM_HPP
3
4 #include <cstddef>
5 #include <utility>
6 #include <vector>
7
8 #include "beamfd/types.hpp"
9
10 namespace beamfd {
11
12 /// A 1D Euler-Bernoulli beam discretized on a uniform grid, with a possibly
13 /// non-uniform flexural rigidity EI(x), an optional Winkler elastic foundation
14 /// k(x), a (possibly spatially varying) transverse load q(x), and optional
15 /// applied force/moment at free ends.
16 ///
17 /// This is a plain data container plus light validation. The numerical core
18 /// (assembling and solving the finite-difference system for the deflection
19 /// field) lives in BeamSolver (see solver.hpp).
20 ///
21 /// Geometry / grid:
22 /// - The beam occupies x in [0, L], divided into `num_intervals` equal cells,
23 /// giving num_nodes() = num_intervals + 1 grid points at x_i = i * dx,
24 /// dx = L / num_intervals, for i = 0 .. num_intervals.
25 ///
26 /// Fields are stored per node (length num_nodes()):
27 /// - EI_at(i) flexural rigidity at node i [N*m^2] (> 0)
28 /// - k_at(i) Winkler foundation modulus at node i [N/m^2] (>= 0; 0 = none)
29 /// - q_at(i) distributed transverse load at node i [N/m]
30 /// plus optional applied actions at free ends (force [N] and moment [N*m]).
31 class Beam {
32 public:
33 /// Construct a beam of length `length` [m] with a uniform flexural rigidity
34 /// `EI` [N*m^2], discretized into `num_intervals` equal cells, with the
35 /// given end supports. EI(x) is initialised constant, k(x) = 0, q(x) = 0.
36 /// Throws std::invalid_argument if length or EI is non-positive or
37 /// num_intervals < 2.
38 Beam(double length, double EI, std::size_t num_intervals, Support left,
39 Support right);
40
41 // ---- Field setters -------------------------------------------------------
42
43 /// Set the nodal flexural-rigidity field EI(x_i). Size must equal
44 /// num_nodes(); every value must be > 0. Throws std::invalid_argument.
45 void set_ei_nodal(const std::vector<double>& ei);
46
47 /// Set EI(x) from piecewise-linear control points (x, value), sampled at
48 /// each node. Points are taken in the given order; x outside the range is
49 /// clamped to the nearest endpoint value. Every sampled value must be > 0.
50 void set_ei_profile(const std::vector<std::pair<double, double>>& points);
51
52 /// Set the nodal Winkler foundation field k(x_i) >= 0. Size == num_nodes().
53 void set_foundation_nodal(const std::vector<double>& k);
54
55 /// Set k(x) from piecewise-linear control points (x, value).
56 void set_foundation_profile(
57 const std::vector<std::pair<double, double>>& points);
58
59 /// Set the nodal distributed-load field q(x_i). Size == num_nodes().
60 void set_q_nodal(const std::vector<double>& q);
61
62 /// Set a uniform distributed load q [N/m] over the whole span (overwrites
63 /// the load field).
64 void set_distributed_load(double q);
65
66 /// Add a piecewise-linear distributed-load segment ramping from q0 at x0 to
67 /// q1 at x1 [N/m] to the existing load field. Segments are additive.
68 void add_load_segment(double x0, double x1, double q0, double q1);
69
70 /// Apply a transverse force P [N] at a free end (`at_left_end` -> x = 0,
71 /// else x = L). Throws std::runtime_error if that end is not Free.
72 void set_end_load(double P, bool at_left_end);
73
74 /// Apply a concentrated moment M [N*m] at a free end. Throws
75 /// std::runtime_error if that end is not Free.
76 void set_end_moment(double M, bool at_left_end);
77
78 // ---- Accessors -----------------------------------------------------------
79
80 double length() const { return length_; }
81 std::size_t num_intervals() const { return num_intervals_; }
82 std::size_t num_nodes() const { return num_intervals_ + 1; }
83 double dx() const { return length_ / static_cast<double>(num_intervals_); }
84 double node_x(std::size_t i) const;
85
86 Support left() const { return left_; }
87 Support right() const { return right_; }
88
89 double EI_at(std::size_t i) const; ///< nodal flexural rigidity [N*m^2]
90 double k_at(std::size_t i) const; ///< nodal foundation modulus [N/m^2]
91 double q_at(std::size_t i) const; ///< nodal distributed load [N/m]
92
93 /// A representative (maximum nodal) flexural rigidity [N*m^2], used as a
94 /// scale for residual normalisation. Equals the constant EI for a uniform
95 /// beam.
96 double EI() const;
97
98 /// True if any nodal foundation modulus is strictly positive.
99 bool has_foundation() const;
100
101 /// Applied end shear V at a free end (`left_end` -> x = 0). A transverse
102 /// force P at a free end contributes V = -P; 0 if no force is applied.
103 double applied_end_shear(bool left_end) const;
104
105 /// Applied end moment M [N*m] at a free end (0 if none).
106 double end_moment(bool left_end) const;
107
108 /// True if any end force has been applied.
109 bool has_end_load() const;
110
111 /// Throws std::runtime_error if the support / foundation combination cannot
112 /// suppress rigid-body motion (a free end opposite a non-clamped end, or
113 /// two free ends, is a mechanism UNLESS an elastic foundation is present).
114 void validate() const;
115
116 private:
117 static std::size_t end_index(bool left_end) { return left_end ? 0u : 1u; }
118
119 double length_{0.0};
120 std::size_t num_intervals_{0};
121 Support left_{Support::Clamped};
122 Support right_{Support::Free};
123 std::vector<double> ei_; // nodal EI, length num_nodes()
124 std::vector<double> k_; // nodal foundation, length num_nodes()
125 std::vector<double> q_; // nodal load, length num_nodes()
126 double force_[2]{0.0, 0.0}; // applied transverse force [left, right]
127 double moment_[2]{0.0, 0.0}; // applied moment [left, right]
128 };
129
130 } // namespace beamfd
131
132 #endif // BEAMFD_BEAM_HPP
133
/opt/beamfd/include/beamfd/linalg.hpp
1 #ifndef BEAMFD_LINALG_HPP
2 #define BEAMFD_LINALG_HPP
3
4 #include <cstddef>
5 #include <stdexcept>
6 #include <vector>
7
8 namespace beamfd {
9
10 /// A small, row-major dense matrix of doubles.
11 ///
12 /// Part of the engine's linear-algebra support layer; fully implemented. The
13 /// beam solver uses it to hold the finite-difference system matrix A in
14 /// A w = b. Unlike a structural stiffness matrix, A here is generally NON
15 /// symmetric (boundary-condition rows are one-sided difference stencils), so
16 /// the solve uses a general LU factorization rather than a Cholesky/LDL^T.
17 class DenseMatrix {
18 public:
19 DenseMatrix() = default;
20
21 DenseMatrix(std::size_t rows, std::size_t cols)
22 : rows_(rows), cols_(cols), data_(rows * cols, 0.0) {}
23
24 std::size_t rows() const { return rows_; }
25 std::size_t cols() const { return cols_; }
26
27 double& operator()(std::size_t r, std::size_t c) {
28 return data_[r * cols_ + c];
29 }
30 double operator()(std::size_t r, std::size_t c) const {
31 return data_[r * cols_ + c];
32 }
33
34 void fill(double v) {
35 for (auto& x : data_) x = v;
36 }
37
38 private:
39 std::size_t rows_{0};
40 std::size_t cols_{0};
41 std::vector<double> data_;
42 };
43
44 /// Solve the general (possibly non-symmetric) linear system A x = b by LU
45 /// factorization with partial (row) pivoting.
46 ///
47 /// `A` is the n-by-n system matrix and `b` is the right-hand side of length n.
48 /// Returns the solution vector x of length n.
49 ///
50 /// Throws std::runtime_error if A is not square, if the dimensions are
51 /// inconsistent, or if A is detected to be singular (a pivot column is
52 /// numerically zero), which is how an under-/over-determined boundary-value
53 /// problem surfaces.
54 std::vector<double> solve_general(const DenseMatrix& A,
55 const std::vector<double>& b);
56
57 } // namespace beamfd
58
59 #endif // BEAMFD_LINALG_HPP
60
/opt/beamfd/include/beamfd/types.hpp
1 #ifndef BEAMFD_TYPES_HPP
2 #define BEAMFD_TYPES_HPP
3
4 #include <cstddef>
5
6 namespace beamfd {
7
8 /// Type of support condition applied at one end of the beam.
9 ///
10 /// - Clamped (built-in / fixed): deflection and slope are both zero
11 /// (w = 0, w' = 0).
12 /// - Pinned (simple support): deflection is zero and the bending moment
13 /// is zero (w = 0, M = 0).
14 /// - Free: the bending moment and shear take their
15 /// applied values (M = M_applied, V = V_applied), both zero when no end
16 /// action is applied.
17 ///
18 /// See instruction.md for the continuum boundary-value problem these encode.
19 enum class Support {
20 Clamped,
21 Pinned,
22 Free,
23 };
24
25 } // namespace beamfd
26
27 #endif // BEAMFD_TYPES_HPP
28
**/*
CMakeLists.txt examples/cantilever_tip.beam include/beamfd/linalg.hpp src/linalg.cpp src/main.cpp tests/test_util.hpp include/beamfd/types.hpp include/beamfd/beam.hpp src/beam.cpp include/beamfd/solver.hpp src/solver.cpp src/io.cpp include/beamfd/io.hpp tests/test_smoke.cpp tests/CMakeLists.txt
/opt/beamfd/src/beam.cpp
1 #include "beamfd/beam.hpp"
2
3 #include <algorithm>
4 #include <stdexcept>
5
6 namespace beamfd {
7
8 namespace {
9
10 // Piecewise-linear interpolation of control points (x, value) at coordinate x.
11 // Points are used in the given order (assumed nondecreasing in x); x outside
12 // the range is clamped to the nearest endpoint.
13 double interp(const std::vector<std::pair<double, double>>& pts, double x) {
14 if (pts.empty()) {
15 throw std::invalid_argument("Beam: empty profile control points");
16 }
17 if (x <= pts.front().first) return pts.front().second;
18 if (x >= pts.back().first) return pts.back().second;
19 for (std::size_t s = 1; s < pts.size(); ++s) {
20 const double x0 = pts[s - 1].first, x1 = pts[s].first;
21 if (x <= x1) {
22 const double t = (x1 > x0) ? (x - x0) / (x1 - x0) : 0.0;
23 return pts[s - 1].second + t * (pts[s].second - pts[s - 1].second);
24 }
25 }
26 return pts.back().second;
27 }
28
29 } // namespace
30
31 Beam::Beam(double length, double EI, std::size_t num_intervals, Support left,
32 Support right)
33 : length_(length),
34 num_intervals_(num_intervals),
35 left_(left),
36 right_(right) {
37 if (length_ <= 0.0) {
38 throw std::invalid_argument("Beam: length must be positive");
39 }
40 if (EI <= 0.0) {
41 throw std::invalid_argument("Beam: EI must be positive");
42 }
43 if (num_intervals_ < 2) {
44 throw std::invalid_argument("Beam: need at least 2 intervals");
45 }
46 const std::size_t n = num_nodes();
47 ei_.assign(n, EI);
48 k_.assign(n, 0.0);
49 q_.assign(n, 0.0);
50 }
51
52 void Beam::set_ei_nodal(const std::vector<double>& ei) {
53 if (ei.size() != num_nodes()) {
54 throw std::invalid_argument("Beam::set_ei_nodal: size mismatch");
55 }
56 for (double v : ei) {
57 if (v <= 0.0) {
58 throw std::invalid_argument("Beam::set_ei_nodal: EI must be positive");
59 }
60 }
61 ei_ = ei;
62 }
63
64 void Beam::set_ei_profile(const std::vector<std::pair<double, double>>& points) {
65 std::vector<double> ei(num_nodes());
66 for (std::size_t i = 0; i < num_nodes(); ++i) ei[i] = interp(points, node_x(i));
67 set_ei_nodal(ei);
68 }
69
70 void Beam::set_foundation_nodal(const std::vector<double>& k) {
71 if (k.size() != num_nodes()) {
72 throw std::invalid_argument("Beam::set_foundation_nodal: size mismatch");
73 }
74 for (double v : k) {
75 if (v < 0.0) {
76 throw std::invalid_argument(
77 "Beam::set_foundation_nodal: k must be non-negative");
78 }
79 }
80 k_ = k;
81 }
82
83 void Beam::set_foundation_profile(
84 const std::vector<std::pair<double, double>>& points) {
85 std::vector<double> k(num_nodes());
86 for (std::size_t i = 0; i < num_nodes(); ++i) k[i] = interp(points, node_x(i));
87 set_foundation_nodal(k);
88 }
89
90 void Beam::set_q_nodal(const std::vector<double>& q) {
91 if (q.size() != num_nodes()) {
92 throw std::invalid_argument("Beam::set_q_nodal: size mismatch");
93 }
94 q_ = q;
95 }
96
97 void Beam::set_distributed_load(double q) { q_.assign(num_nodes(), q); }
98
99 void Beam::add_load_segment(double x0, double x1, double q0, double q1) {
100 if (x1 < x0) {
101 std::swap(x0, x1);
102 std::swap(q0, q1);
103 }
104 for (std::size_t i = 0; i < num_nodes(); ++i) {
105 const double x = node_x(i);
106 if (x < x0 || x > x1) continue;
107 const double t = (x1 > x0) ? (x - x0) / (x1 - x0) : 0.0;
108 q_[i] += q0 + t * (q1 - q0);
109 }
110 }
111
112 void Beam::set_end_load(double P, bool at_left_end) {
113 const Support s = at_left_end ? left_ : right_;
114 if (s != Support::Free) {
115 throw std::runtime_error(
116 "Beam::set_end_load: end load may only be applied at a free end");
117 }
118 force_[end_index(at_left_end)] = P;
119 }
120
121 void Beam::set_end_moment(double M, bool at_left_end) {
122 const Support s = at_left_end ? left_ : right_;
123 if (s != Support::Free) {
124 throw std::runtime_error(
125 "Beam::set_end_moment: end moment may only be applied at a free end");
126 }
127 moment_[end_index(at_left_end)] = M;
128 }
129
130 double Beam::node_x(std::size_t i) const {
131 if (i > num_intervals_) {
132 throw std::out_of_range("Beam::node_x: node index out of range");
133 }
134 return static_cast<double>(i) * dx();
135 }
136
137 double Beam::EI_at(std::size_t i) const {
138 if (i >= ei_.size()) throw std::out_of_range("Beam::EI_at: index out of range");
139 return ei_[i];
140 }
141
142 double Beam::k_at(std::size_t i) const {
143 if (i >= k_.size()) throw std::out_of_range("Beam::k_at: index out of range");
144 return k_[i];
145 }
146
147 double Beam::q_at(std::size_t i) const {
148 if (i >= q_.size()) throw std::out_of_range("Beam::q_at: index out of range");
149 return q_[i];
150 }
151
152 double Beam::EI() const {
153 double m = 0.0;
154 for (double v : ei_) m = std::max(m, v);
155 return m;
156 }
157
158 bool Beam::has_foundation() const {
159 for (double v : k_) {
160 if (v > 0.0) return true;
161 }
162 return false;
163 }
164
165 double Beam::applied_end_shear(bool left_end) const {
166 return -force_[end_index(left_end)];
167 }
168
169 double Beam::end_moment(bool left_end) const { return moment_[end_index(left_end)]; }
170
171 bool Beam::has_end_load() const { return force_[0] != 0.0 || force_[1] != 0.0; }
172
173 void Beam::validate() const {
174 const bool left_free = (left_ == Support::Free);
175 const bool right_free = (right_ == Support::Free);
176
177 // An elastic foundation supplies distributed restraint that removes the
178 // rigid-body modes, so any support combination is well posed when present.
179 if (has_foundation()) return;
180
181 if (left_free && right_free) {
182 throw std::runtime_error("Beam::validate: free-free beam is a mechanism");
183 }
184 if (left_free && right_ != Support::Clamped) {
185 throw std::runtime_error(
186 "Beam::validate: a free end requires a clamped opposite end");
187 }
188 if (right_free && left_ != Support::Clamped) {
189 throw std::runtime_error(
190 "Beam::validate: a free end requires a clamped opposite end");
191 }
192 }
193
194 } // namespace beamfd
195
/opt/beamfd/tests/test_smoke.cpp
1 // Smoke test for the beamfd project: a minimal, non-leaky sanity check so the
2 // project compiles and a solver gets quick feedback. It asserts only generic
3 // properties (finite field, pinned ends fixed, a non-trivial deflection, and a
4 // small interior discrete-equilibrium residual) and contains NO closed-form
5 // answer. The authoritative grading is performed by a separate hidden suite.
6
7 #include <algorithm>
8 #include <cmath>
9
10 #include "beamfd/beam.hpp"
11 #include "beamfd/solver.hpp"
12 #include "test_util.hpp"
13
14 using namespace beamfd;
15
16 BEAMFD_TEST("smoke_pinned_udl_sane") {
17 Beam beam(2.0, 1000.0, 20, Support::Pinned, Support::Pinned);
18 beam.set_distributed_load(5.0);
19 BeamSolver solver(beam);
20 BeamResult r = solver.solve();
21 const std::size_t n = beam.num_nodes();
22
23 beamfd_test::expect(r.deflection.size() == n, "deflection has num_nodes entries");
24 for (double w : r.deflection) {
25 beamfd_test::expect(std::isfinite(w), "deflection is finite");
26 }
27 beamfd_test::expect_near(r.deflection[0], 0.0, 1e-9, "left pin fixed");
28 beamfd_test::expect_near(r.deflection[n - 1], 0.0, 1e-9, "right pin fixed");
29 beamfd_test::expect(r.deflection[n / 2] > 0.0, "mid-span deflects under load");
30
31 // Interior discrete-equilibrium residual A w - b ~ 0 (relative to scale).
32 BeamSystem sys = solver.assemble_system();
33 double scale = 0.0;
34 for (double w : r.deflection) scale = std::max(scale, std::fabs(w));
35 const double c4 = beam.EI() / std::pow(beam.dx(), 4);
36 for (std::size_t i = 2; i + 2 < n; ++i) {
37 double res = -sys.b[i];
38 for (std::size_t j = 0; j < n; ++j) res += sys.A(i, j) * r.deflection[j];
39 beamfd_test::expect(std::fabs(res) <= 1e-6 * (c4 * scale) + 1e-9,
40 "interior equilibrium residual is small");
41 }
42 }
43
44 BEAMFD_TEST_MAIN()
45
/opt/beamfd/examples/cantilever_tip.beam
1 # Cantilever beam with a downward point load at the free tip. 2 # Clamped (built-in) at x = 0, free at x = L. 3 length 3.0 # span [m] 4 ei 2.0e6 # flexural rigidity EI [N*m^2] 5 cells 200 # number of equal finite-difference intervals 6 7 # Left end clamped, right end free. 8 support clamped free 9 10 # Downward point load of 1 kN at the free right tip. 11 endload right 1000.0 12
/opt/beamfd/src/main.cpp
1 #include <cstdlib>
2 #include <iostream>
3
4 #include "beamfd/beam.hpp"
5 #include "beamfd/io.hpp"
6 #include "beamfd/solver.hpp"
7
8 // Command-line demo driver: read a .beam definition, solve it, print a report.
9 // beamfd_cli <model.beam>
10 int main(int argc, char** argv) {
11 if (argc != 2) {
12 std::cerr << "usage: " << argv[0] << " <model.beam>\n";
13 return 2;
14 }
15 try {
16 beamfd::Beam beam = beamfd::parse_beam_file(argv[1]);
17 beamfd::BeamSolver solver(beam);
18 beamfd::BeamResult result = solver.solve();
19 beamfd::write_report(std::cout, beam, result);
20 } catch (const std::exception& ex) {
21 std::cerr << "error: " << ex.what() << "\n";
22 return 1;
23 }
24 return 0;
25 }
26
/opt/beamfd/tests/test_util.hpp
1 #ifndef BEAMFD_TEST_UTIL_HPP
2 #define BEAMFD_TEST_UTIL_HPP
3
4 // Minimal dependency-free test harness for the beamfd suite.
5 //
6 // Each test executable defines test functions and registers them with
7 // BEAMFD_TEST(name) { ... }. main() (provided by BEAMFD_TEST_MAIN) runs every
8 // registered test and returns non-zero if any assertion fails, which CTest
9 // interprets as a failure.
10
11 #include <cmath>
12 #include <cstddef>
13 #include <functional>
14 #include <iostream>
15 #include <string>
16 #include <vector>
17
18 namespace beamfd_test {
19
20 struct Case {
21 std::string name;
22 std::function<void()> fn;
23 };
24
25 inline std::vector<Case>& registry() {
26 static std::vector<Case> cases;
27 return cases;
28 }
29
30 struct Registrar {
31 Registrar(const std::string& name, std::function<void()> fn) {
32 registry().push_back(Case{name, std::move(fn)});
33 }
34 };
35
36 // Thrown by an assertion failure to abort the current test case.
37 struct AssertionError {
38 std::string message;
39 };
40
41 inline void expect(bool cond, const std::string& what) {
42 if (!cond) {
43 throw AssertionError{what};
44 }
45 }
46
47 inline void expect_near(double got, double want, double tol, const std::string& what) {
48 if (std::fabs(got - want) > tol) {
49 throw AssertionError{what + " (got " + std::to_string(got) +
50 ", want " + std::to_string(want) +
51 ", tol " + std::to_string(tol) + ")"};
52 }
53 }
54
55 // Relative-error check (with an absolute floor) for quantities whose scale
56 // varies widely across cases.
57 inline void expect_rel(double got, double want, double rel_tol,
58 const std::string& what) {
59 const double denom = std::fabs(want) > 1e-300 ? std::fabs(want) : 1.0;
60 if (std::fabs(got - want) / denom > rel_tol) {
61 throw AssertionError{what + " (got " + std::to_string(got) +
62 ", want " + std::to_string(want) +
63 ", rel_tol " + std::to_string(rel_tol) + ")"};
64 }
65 }
66
67 inline int run_all() {
68 int failures = 0;
69 for (const auto& c : registry()) {
70 try {
71 c.fn();
72 std::cout << "[ PASS ] " << c.name << "\n";
73 } catch (const AssertionError& e) {
74 std::cout << "[ FAIL ] " << c.name << ": " << e.message << "\n";
75 ++failures;
76 } catch (const std::exception& e) {
77 std::cout << "[ FAIL ] " << c.name
78 << ": unexpected exception: " << e.what() << "\n";
79 ++failures;
80 } catch (...) {
81 std::cout << "[ FAIL ] " << c.name << ": unknown exception\n";
82 ++failures;
83 }
84 }
85 std::cout << "----\n"
86 << (registry().size() - failures) << "/" << registry().size()
87 << " tests passed\n";
88 return failures == 0 ? 0 : 1;
89 }
90
91 } // namespace beamfd_test
92
93 #define BEAMFD_CONCAT_INNER(a, b) a##b
94 #define BEAMFD_CONCAT(a, b) BEAMFD_CONCAT_INNER(a, b)
95
96 #define BEAMFD_TEST(NAME) \
97 static void BEAMFD_CONCAT(beamfd_test_fn_, __LINE__)(); \
98 static ::beamfd_test::Registrar BEAMFD_CONCAT(beamfd_test_reg_, \
99 __LINE__){ \
100 NAME, &BEAMFD_CONCAT(beamfd_test_fn_, __LINE__)}; \
101 static void BEAMFD_CONCAT(beamfd_test_fn_, __LINE__)()
102
103 #define BEAMFD_TEST_MAIN() \
104 int main() { return ::beamfd_test::run_all(); }
105
106 #endif // BEAMFD_TEST_UTIL_HPP
107
/opt/beamfd/src/solver.cpp
BeamSystem BeamSolver::assemble_system() const {
// TODO(candidate): build and return the finite-difference system A w = b.
const std::size_t n = beam_.num_nodes();
BeamSystem sys;
sys.A = DenseMatrix(n, n); // all zeros -> singular / wrong
sys.b.assign(n, 0.0);
return sys;
}
BeamResult BeamSolver::solve() const {
// TODO(candidate): validate, assemble, solve, return the deflection field.
const std::size_t n = beam_.num_nodes();
BeamResult result;
result.deflection.assign(n, 0.0); // trivially zero -> wrong
return result;
}BeamSystem BeamSolver::assemble_system() const {
// Finite-difference discretization of the conservative Euler-Bernoulli
// equation d2/dx2( EI(x) w''(x) ) + k(x) w(x) = q(x) on the uniform grid
// x_i = i*dx, i = 0..N (n = N+1 nodal unknowns w_i = w(x_i)).
//
// Writing M(x) = EI(x) w''(x), the equation is M''(x) + k w = q. The
// interior rows enforce this with a second-order conservative stencil:
// central second differences build M_j at each node, and a second central
// difference of M gives M''_i. The four boundary conditions (two per end)
// replace the rows nearest each end (0,1 and n-2,n-1) and are discretized
// to the same second order using the *same* one-sided operators as the
// recovery helpers above, so the boundary moment/shear are consistent with
// bending_moment_field / shear_field.
const std::size_t n = beam_.num_nodes();
const double h = beam_.dx();
const double h2 = h * h;
BeamSystem sys;
sys.A = DenseMatrix(n, n);
sys.b.assign(n, 0.0);
DenseMatrix& A = sys.A;
// Add factor * w''(x_j) into row r of A, using a second-order central
// difference at interior nodes and a second-order one-sided difference at
// the ends (matching second_derivative() used by the recovery helpers).
auto add_d2 = [&](std::size_t r, std::size_t j, double factor) {
const double f = factor / h2;
if (j == 0) {
A(r, 0) += 2.0 * f;
A(r, 1) += -5.0 * f;
A(r, 2) += 4.0 * f;
A(r, 3) += -1.0 * f;
} else if (j == n - 1) {
A(r, n - 1) += 2.0 * f;
A(r, n - 2) += -5.0 * f;
A(r, n - 3) += 4.0 * f;
A(r, n - 4) += -1.0 * f;
} else {
A(r, j - 1) += 1.0 * f;
A(r, j) += -2.0 * f;
A(r, j + 1) += 1.0 * f;
}
};
// Add factor * M(x_j) = factor * EI_j * w''(x_j) into row r of A.
auto add_moment = [&](std::size_t r, std::size_t j, double factor) {
add_d2(r, j, factor * beam_.EI_at(j));
};
// ---- Interior equilibrium rows: M''_i + k_i w_i = q_i ------------------
// M''_i = ( M_{i-1} - 2 M_i + M_{i+1} ) / h^2, with each M_j a central
// second difference (j = i-1, i, i+1 are all interior here).
for (std::size_t i = 2; i + 2 < n; ++i) {
add_moment(i, i - 1, 1.0 / h2);
add_moment(i, i, -2.0 / h2);
add_moment(i, i + 1, 1.0 / h2);
A(i, i) += beam_.k_at(i);
sys.b[i] = beam_.q_at(i);
}
// ---- Left-end boundary conditions: rows 0 and 1 -----------------------
switch (beam_.left()) {
case Support::Clamped:
// w_0 = 0 and w'_0 = 0.
A(0, 0) = 1.0;
A(1, 0) = -3.0 / (2.0 * h);
A(1, 1) = 4.0 / (2.0 * h);
A(1, 2) = -1.0 / (2.0 * h);
break;
case Support::Pinned:
// w_0 = 0 and M_0 = EI_0 w''_0 = 0.
A(0, 0) = 1.0;
add_d2(1, 0, 1.0);
break;
case Support::Free:
// V_0 = (EI w'')'_0 = V_applied and M_0 = EI_0 w''_0 = M_applied.
add_moment(0, 0, -3.0 / (2.0 * h));
add_moment(0, 1, 4.0 / (2.0 * h));
add_moment(0, 2, -1.0 / (2.0 * h));
sys.b[0] = beam_.applied_end_shear(true);
add_moment(1, 0, 1.0);
sys.b[1] = beam_.end_moment(true);
break;
}
// ---- Right-end boundary conditions: rows n-2 and n-1 ------------------
switch (beam_.right()) {
case Support::Clamped:
// w_N = 0 and w'_N = 0.
A(n - 1, n - 1) = 1.0;
A(n - 2, n - 1) = 3.0 / (2.0 * h);
A(n - 2, n - 2) = -4.0 / (2.0 * h);
A(n - 2, n - 3) = 1.0 / (2.0 * h);
break;
case Support::Pinned:
// w_N = 0 and M_N = EI_N w''_N = 0.
A(n - 1, n - 1) = 1.0;
add_d2(n - 2, n - 1, 1.0);
break;
case Support::Free:
// V_N = (EI w'')'_N = V_applied and M_N = EI_N w''_N = M_applied.
add_moment(n - 1, n - 1, 3.0 / (2.0 * h));
add_moment(n - 1, n - 2, -4.0 / (2.0 * h));
add_moment(n - 1, n - 3, 1.0 / (2.0 * h));
sys.b[n - 1] = beam_.applied_end_shear(false);
add_moment(n - 2, n - 1, 1.0);
sys.b[n - 2] = beam_.end_moment(false);
break;
}
return sys;
}
BeamResult BeamSolver::solve() const {
beam_.validate();
const BeamSystem sys = assemble_system();
BeamResult result;
result.deflection = solve_general(sys.A, sys.b);
return result;
}cmake -S . -B build -DCMAKE_BUILD_TYPE=Release > /tmp/cmake.log 2>&1 && cmake --build build --parallel > /tmp/build.log 2>&1 && echo "BUILD OK" && cd build && ctest --output-on-failure 2>&1 | tail -30
BUILD OK
Test project /opt/beamfd/build
Start 1: smoke
1/1 Test #1: smoke ............................ Passed 0.00 sec
100% tests passed, 0 tests failed out of 1
Total Test time (real) = 0.00 sec
[stdout]
BUILD OK
Test project /opt/beamfd/build
Start 1: smoke
1/1 Test #1: smoke ............................ Passed 0.00 sec
100% tests passed, 0 tests failed out of 1
Total Test time (real) = 0.00 sec/opt/beamfd/CMakeLists.txt
1 cmake_minimum_required(VERSION 3.16)
2 project(beamfd LANGUAGES CXX)
3
4 set(CMAKE_CXX_STANDARD 17)
5 set(CMAKE_CXX_STANDARD_REQUIRED ON)
6 set(CMAKE_CXX_EXTENSIONS OFF)
7
8 if(NOT CMAKE_BUILD_TYPE)
9 set(CMAKE_BUILD_TYPE Release)
10 endif()
11
12 add_compile_options(-Wall -Wextra)
13
14 # --- Core library -----------------------------------------------------------
15 add_library(beamfd
16 src/linalg.cpp
17 src/beam.cpp
18 src/solver.cpp
19 src/io.cpp
20 )
21 target_include_directories(beamfd PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/include)
22
23 # --- Demo CLI ---------------------------------------------------------------
24 add_executable(beamfd_cli src/main.cpp)
25 target_link_libraries(beamfd_cli PRIVATE beamfd)
26
27 # --- Tests ------------------------------------------------------------------
28 enable_testing()
29 add_subdirectory(tests)
30
#include <cmath>
#include <cstdio>
#include <vector>
#include "beamfd/beam.hpp"
#include "beamfd/solver.hpp"
using namespace beamfd;
static double max_abs_err(const std::vector<double>& w,
const std::function<double(double)>& exact, const Beam& b) {
double e = 0;
for (std::size_t i = 0; i < w.size(); ++i)
e = std::max(e, std::fabs(w[i] - exact(b.node_x(i))));
return e;
}
int main() {
// 1) Cantilever, tip load P at right free end. Clamped at x=0.
// Analytic (PDE EI w'''' = q=0; BC V(L)=applied_end_shear=-P, M(L)=0,
// w(0)=w'(0)=0). EI w'' = M(x) = ... solve: w(x) with V const.
// (EI w'')'' = 0 -> M linear. M(L)=0, V(L)=M'(L)=-P (applied shear).
// => M'(x) = -P => M(x) = -P(x-L). EI w'' = -P(x-L).
// w'' = -P(x-L)/EI. integrate: w' = -P(x^2/2 - Lx)/EI (w'(0)=0)
// w = -P(x^3/6 - L x^2/2)/EI (w(0)=0).
{
double L=3.0, EI=2.0e6, P=1000.0;
for (int N : {50,100,200,400}) {
Beam b(L,EI,N,Support::Clamped,Support::Free);
b.set_end_load(P,false);
BeamSolver s(b); auto r=s.solve();
auto exact=[&](double x){ return -P*(x*x*x/6.0 - L*x*x/2.0)/EI; };
printf("cantilever N=%d err=%.3e tip=%.6e exact_tip=%.6e\n",
N, max_abs_err(r.deflection,exact,b), r.deflection.back(), exact(L));
}
}
// 2) Pinned-pinned UDL q. w = q x (L^3 - 2 L x^2 + x^3)/(24 EI).
{
double L=2.0, EI=1000.0, q=5.0;
for (int N : {50,100,200,400}) {
Beam b(L,EI,N,Support::Pinned,Support::Pinned);
b.set_distributed_load(q);
BeamSolver s(b); auto r=s.solve();
auto exact=[&](double x){ return q*x*(L*L*L - 2*L*x*x + x*x*x)/(24.0*EI); };
printf("pinned-udl N=%d err=%.3e mid=%.6e exact_mid=%.6e\n",
N, max_abs_err(r.deflection,exact,b), r.deflection[N/2], exact(L/2));
}
}
// 3) Clamped-clamped UDL q. w = q x^2 (L-x)^2/(24 EI).
{
double L=2.0, EI=1000.0, q=5.0;
for (int N : {50,100,200,400}) {
Beam b(L,EI,N,Support::Clamped,Support::Clamped);
b.set_distributed_load(q);
BeamSolver s(b); auto r=s.solve();
auto exact=[&](double x){ return q*x*x*(L-x)*(L-x)/(24.0*EI); };
printf("clamped-udl N=%d err=%.3e mid=%.6e exact_mid=%.6e\n",
N, max_abs_err(r.deflection,exact,b), r.deflection[N/2], exact(L/2));
}
}
// 4) Foundation: free-free beam on Winkler foundation, constant q.
// Particular static solution w = q/k (uniform), with k>0 making it well posed.
{
double L=2.0, EI=1000.0, q=5.0, k=200.0;
for (int N : {50,100,200,400}) {
Beam b(L,EI,N,Support::Free,Support::Free);
b.set_distributed_load(q);
b.set_foundation_nodal(std::vector<double>(N+1,k));
BeamSolver s(b); auto r=s.solve();
auto exact=[&](double){ return q/k; }; // uniform: w''=0 so EI term 0, k w=q
printf("foundation N=%d err=%.3e w0=%.6e exact=%.6e\n",
N, max_abs_err(r.deflection,exact,b), r.deflection[0], q/k);
}
}
return 0;
}
cd /opt/beamfd && g++ -std=c++17 -O2 -Iinclude verify.cpp src/beam.cpp src/solver.cpp src/linalg.cpp -o /tmp/verify 2>&1 | head -20 && /tmp/verify
Exit code 127
verify.cpp:9:38: error: 'function' in namespace 'std' does not name a template type
9 | const std::function<double(double)>& exact, const Beam& b) {
| ^~~~~~~~
verify.cpp:6:1: note: 'std::function' is defined in header '<functional>'; did you forget to '#include <functional>'?
5 | #include "beamfd/solver.hpp"
+++ |+#include <functional>
6 | using namespace beamfd;
verify.cpp:9:46: error: expected ',' or '...' before '<' token
9 | const std::function<double(double)>& exact, const Beam& b) {
| ^
verify.cpp: In function 'double max_abs_err(const std::vector<double>&, int)':
verify.cpp:12:48: error: 'b' was not declared in this scope
12 | e = std::max(e, std::fabs(w[i] - exact(b.node_x(i))));
| ^
verify.cpp:12:42: error: 'exact' was not declared in this scope
12 | e = std::max(e, std::fabs(w[i] - exact(b.node_x(i))));
| ^~~~~
verify.cpp: In function 'int main()':
verify.cpp:32:48: error: cannot convert 'main()::<lambda(double)>' to 'int'
32 | N, max_abs_err(r.deflection,exact,b), r.deflection.back(), exact(L));
/bin/bash: line 1: /tmp/verify: No such file or directory
[error] tool reported failure/opt/beamfd/verify.cpp
#include <cmath> #include <cstdio> #include <vector>
#include <cmath> #include <cstdio> #include <functional> #include <algorithm> #include <vector>
cd /opt/beamfd && g++ -std=c++17 -O2 -Iinclude verify.cpp src/beam.cpp src/solver.cpp src/linalg.cpp -o /tmp/verify 2>&1 | head -20 && /tmp/verify
cantilever N=50 err=1.800e-06 tip=4.498200e-03 exact_tip=4.500000e-03 cantilever N=100 err=4.500e-07 tip=4.499550e-03 exact_tip=4.500000e-03 cantilever N=200 err=1.127e-07 tip=4.499887e-03 exact_tip=4.500000e-03 cantilever N=400 err=3.103e-08 tip=4.499969e-03 exact_tip=4.500000e-03 pinned-udl N=50 err=3.667e-06 mid=1.038000e-03 exact_mid=1.041667e-03 pinned-udl N=100 err=9.167e-07 mid=1.040750e-03 exact_mid=1.041667e-03 pinned-udl N=200 err=2.292e-07 mid=1.041437e-03 exact_mid=1.041667e-03 pinned-udl N=400 err=5.731e-08 mid=1.041609e-03 exact_mid=1.041667e-03 clamped-udl N=50 err=1.293e-06 mid=2.070400e-04 exact_mid=2.083333e-04 clamped-udl N=100 err=3.283e-07 mid=2.080050e-04 exact_mid=2.083333e-04 clamped-udl N=200 err=8.271e-08 mid=2.082506e-04 exact_mid=2.083333e-04 clamped-udl N=400 err=2.075e-08 mid=2.083126e-04 exact_mid=2.083333e-04 foundation N=50 err=1.370e-11 w0=2.500000e-02 exact=2.500000e-02 foundation N=100 err=2.213e-10 w0=2.500000e-02 exact=2.500000e-02 foundation N=200 err=6.480e-10 w0=2.500000e-02 exact=2.500000e-02 foundation N=400 err=8.994e-09 w0=2.500000e-02 exact=2.500000e-02 [stdout] cantilever N=50 err=1.800e-06 tip=4.498200e-03 exact_tip=4.500000e-03 cantilever N=100 err=4.500e-07 tip=4.499550e-03 exact_tip=4.500000e-03 cantilever N=200 err=1.127e-07 tip=4.499887e-03 exact_tip=4.500000e-03 cantilever N=400 err=3.103e-08 tip=4.499969e-03 exact_tip=4.500000e-03 pinned-udl N=50 err=3.667e-06 mid=1.038000e-03 exact_mid=1.041667e-03 pinned-udl N=100 err=9.167e-07 mid=1.040750e-03 exact_mid=1.041667e-03 pinned-udl N=200 err=2.292e-07 mid=1.041437e-03 exact_mid=1.041667e-03 pinned-udl N=400 err=5.731e-08 mid=1.041609e-03 exact_mid=1.041667e-03 clamped-udl N=50 err=1.293e-06 mid=2.070400e-04 exact_mid=2.083333e-04 clamped-udl N=100 err=3.283e-07 mid=2.080050e-04 exact_mid=2.083333e-04 clamped-udl N=200 err=8.271e-08 mid=2.082506e-04 exact_mid=2.083333e-04 clamped-udl N=400 err=2.075e-08 mid=2.083126e-04 exact_mid=2.083333e-04 foundation N=50 err=1.370e-11 w0=2.500000e-02 exact=2.500000e-02 foundation N=100 err=2.213e-10 w0=2.500000e-02 exact=2.500000e-02 foundation N=200 err=6.480e-10 w0=2.500000e-02 exact=2.500000e-02 foundation N=400 err=8.994e-09 w0=2.500000e-02 exact=2.500000e-02
/opt/beamfd/verify.cpp
return 0; }
// 5) Variable EI: clamped-clamped. EI(x)=c(1+x/L) (linear, sampled exact),
// exact w=x^2(L-x)^2 -> q = M'' = 72 c x / L (linear, set nodally exact).
{
double L=2.0, c=500.0;
for (int N : {50,100,200,400}) {
Beam b(L,c,N,Support::Clamped,Support::Clamped);
b.set_ei_profile({{0.0,c},{L,2.0*c}});
std::vector<double> q(N+1);
for (int i=0;i<=N;++i){double x=b.node_x(i); q[i]=72.0*c*x/L;}
b.set_q_nodal(q);
BeamSolver s(b); auto r=s.solve();
auto exact=[&](double x){ return x*x*(L-x)*(L-x); };
printf("varEI-cc N=%d err=%.3e mid=%.6e exact_mid=%.6e\n",
N, max_abs_err(r.deflection,exact,b), r.deflection[N/2], exact(L/2));
}
}
// 6) Cantilever with tip end-moment M0 (no load): w = M0 x^2/(2 EI).
{
double L=3.0, EI=2.0e6, M0=1500.0;
for (int N : {50,100,200,400}) {
Beam b(L,EI,N,Support::Clamped,Support::Free);
b.set_end_moment(M0,false);
BeamSolver s(b); auto r=s.solve();
auto exact=[&](double x){ return M0*x*x/(2.0*EI); };
printf("endmoment N=%d err=%.3e tip=%.6e exact_tip=%.6e\n",
N, max_abs_err(r.deflection,exact,b), r.deflection.back(), exact(L));
}
}
return 0;
}g++ -std=c++17 -O2 -Iinclude verify.cpp src/beam.cpp src/solver.cpp src/linalg.cpp -o /tmp/verify 2>&1 | head -20 && /tmp/verify 2>&1 | tail -8
varEI-cc N=50 err=6.208e-03 mid=9.937920e-01 exact_mid=1.000000e+00 varEI-cc N=100 err=1.576e-03 mid=9.984240e-01 exact_mid=1.000000e+00 varEI-cc N=200 err=3.970e-04 mid=9.996030e-01 exact_mid=1.000000e+00 varEI-cc N=400 err=9.964e-05 mid=9.999004e-01 exact_mid=1.000000e+00 endmoment N=50 err=5.702e-13 tip=3.375000e-03 exact_tip=3.375000e-03 endmoment N=100 err=7.058e-12 tip=3.375000e-03 exact_tip=3.375000e-03 endmoment N=200 err=1.074e-10 tip=3.375000e-03 exact_tip=3.375000e-03 endmoment N=400 err=1.999e-09 tip=3.374998e-03 exact_tip=3.375000e-03 [stdout] varEI-cc N=50 err=6.208e-03 mid=9.937920e-01 exact_mid=1.000000e+00 varEI-cc N=100 err=1.576e-03 mid=9.984240e-01 exact_mid=1.000000e+00 varEI-cc N=200 err=3.970e-04 mid=9.996030e-01 exact_mid=1.000000e+00 varEI-cc N=400 err=9.964e-05 mid=9.999004e-01 exact_mid=1.000000e+00 endmoment N=50 err=5.702e-13 tip=3.375000e-03 exact_tip=3.375000e-03 endmoment N=100 err=7.058e-12 tip=3.375000e-03 exact_tip=3.375000e-03 endmoment N=200 err=1.074e-10 tip=3.375000e-03 exact_tip=3.375000e-03 endmoment N=400 err=1.999e-09 tip=3.374998e-03 exact_tip=3.375000e-03
rm -f verify.cpp && cmake --build build --parallel >/dev/null 2>&1 && cd build && ctest --output-on-failure 2>&1 | tail -5
1/1 Test #1: smoke ............................ Passed 0.00 sec 100% tests passed, 0 tests failed out of 1 Total Test time (real) = 0.00 sec [stdout] 1/1 Test #1: smoke ............................ Passed 0.00 sec 100% tests passed, 0 tests failed out of 1 Total Test time (real) = 0.00 sec
No file changes, the agent left the workspace untouched.
== Configuring (cmake) ==
-- The CXX compiler identification is GNU 11.4.0
-- Detecting CXX compiler ABI info
-- Detecting CXX compiler ABI info - done
-- Check for working CXX compiler: /usr/bin/c++ - skipped
-- Detecting CXX compile features
-- Detecting CXX compile features - done
-- Configuring done
-- Generating done
-- Build files have been written to: /tmp/tmp.ggiBOlWRdK/beamfd/build_grade
== Building ==
[ 6%] Building CXX object CMakeFiles/beamfd.dir/src/solver.cpp.o
[ 13%] Building CXX object CMakeFiles/beamfd.dir/src/linalg.cpp.o
[ 20%] Building CXX object CMakeFiles/beamfd.dir/src/beam.cpp.o
[ 26%] Building CXX object CMakeFiles/beamfd.dir/src/io.cpp.o
[ 33%] Linking CXX static library libbeamfd.a
[ 33%] Built target beamfd
[ 40%] Building CXX object CMakeFiles/beamfd_cli.dir/src/main.cpp.o
[ 46%] Building CXX object tests/CMakeFiles/test_mms.dir/test_mms.cpp.o
[ 53%] Building CXX object tests/CMakeFiles/test_convergence.dir/test_convergence.cpp.o
[ 60%] Building CXX object tests/CMakeFiles/test_invariants.dir/test_invariants.cpp.o
[ 66%] Building CXX object tests/CMakeFiles/test_soak.dir/test_soak.cpp.o
[ 73%] Linking CXX executable beamfd_cli
[ 73%] Built target beamfd_cli
[ 80%] Linking CXX executable test_convergence
[ 86%] Linking CXX executable test_soak
[ 93%] Linking CXX executable test_mms
[ 93%] Built target test_convergence
[ 93%] Built target test_soak
[100%] Linking CXX executable test_invariants
[100%] Built target test_mms
[100%] Built target test_invariants
== Running hidden test suite (ctest) ==
Test project /tmp/tmp.ggiBOlWRdK/beamfd/build_grade
Start 1: test_mms
1/4 Test #1: test_mms ......................... Passed 0.01 sec
Start 2: test_convergence
2/4 Test #2: test_convergence ................. Passed 0.00 sec
Start 3: test_invariants
3/4 Test #3: test_invariants ..................***Failed 0.00 sec
[ PASS ] invariant_equilibrium_residual
[ FAIL ] invariant_symmetry: symmetry at node 0
[ PASS ] invariant_mechanism_rejection
[ PASS ] invariant_input_validation
----
3/4 tests passed
Start 4: test_soak
4/4 Test #4: test_soak ........................***Failed 0.00 sec
[ FAIL ] soak_random_manufactured_configs: config 1 (family 1, N 160) rel error 0.031437
----
0/1 tests passed
50% tests passed, 2 tests failed out of 4
Label Time Summary:
hidden = 0.02 sec*proc (4 tests)
Total Test time (real) = 0.02 sec
The following tests FAILED:
3 - test_invariants (Failed)
4 - test_soak (Failed)
Errors while running CTest
FAIL: one or more hidden tests failedReproduce this trial: git checkout 2f94510 && PYTHONPATH=src python3 scripts/build_site.py , then open trial/trial_98a41b8bc80646a8. Re-running the agent live requires EVAL_PLATFORM_ENABLE_OAUTH_SMOKE=1 and is non-deterministic.
Trial trial_98a41b8bc80646a8 · verifier authoritative; classifier explanatory.