mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-10 21:07:09 +01:00
Krzysztof kuhy Rudnicki
ffa5dad02a
The 250-line cap applies to prose too, and the reports were the worst
offenders -- ENUME's projectA.tex alone was 1,876 lines. Each is now a
preamble plus one \input{} per section, which is how a long LaTeX document is
normally organised; not one byte of prose was rewritten.
"The PDF is unchanged" is checked by a script rather than by eye, because
hashing the PDF cannot work: pdflatex stamps a /CreationDate and an /ID into
every build, so two runs of the SAME source already differ. tex_fingerprint.sh
compares what a reader sees instead -- page count plus a hash of the extracted
text -- and it is stable across rebuilds of untouched sources, which is the
property that makes it usable as a gate.
It earned its keep immediately. Both ECOTE reports quote an example LaTeX
document inside an lstlisting block, so \end{document} appears in the middle
of the file; splitting on the FIRST one stranded everything after it. Same
page count, different text, caught automatically. EOPSY lab3 exposed a second
bug: a \section{} title that runs onto the next line.
Result: 19 .tex over the cap -> 1. The survivor,
ELAC/.../03-building-nfa-...tex, is 418 lines of consecutive tikz figures
with no subsection to split on and needs a hand-placed boundary.
Verified: 29 splits across two passes (section, then subsection for the
pieces still over), every one reporting `unchanged` from
scripts/tex_fingerprint.sh --check.
Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0172dj34FDpao6wsix8ZuCzE
122 lines
3.5 KiB
TeX
122 lines
3.5 KiB
TeX
\section{Task 3}
|
|
|
|
\subsubsection{Top of Task 3}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
interval = [-5, 10];
|
|
rootBrackets = rootBracketing(@polynomial, interval(1), interval(2));
|
|
|
|
printGraph(@polynomial, 'Laguerre', @laguerre, interval, rootBrackets, 'Approximate zeros of function for method of ');
|
|
|
|
printComplexGraph(@polynomial, 'Laguerre', @laguerre, [-1 - i, 1 + i], 'Aproximate complex roots of polynomial');
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\subsubsection{polynomial}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function y = polynomial(x)
|
|
y = -2 * x^4 + 12 * x^3 + 4* x^2 + 1 * x + 3;
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\subsubsection{laguerre}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [zero, iterations] = laguerre(polynomial, a, b, tolerance)
|
|
[degree, zero, iterations] = initialize(a, b, polynomial);
|
|
[zero, iterations] = laguerreLoop(polynomial, zero, tolerance, iterations, degree);
|
|
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\newpage
|
|
\subsubsection{initialize}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [degree, zero, iterations] = initialize(a, b, polynomial)
|
|
degree = 4;
|
|
zero = (a + b) / 2;
|
|
iterations = [zero; polynomial(zero)];
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\subsubsection{laguerreLoop}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [zero, iterations] = laguerreLoop(polynomial, zero, tolerance, iterations, degree)
|
|
while abs(polynomial(zero)) > tolerance
|
|
[iterations, zero] = insideLoop(polynomial, zero, degree, iterations);
|
|
end
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\subsubsection{insideLoop}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [iterations, zero] = insideLoop(polynomial, zero, degree, iterations)
|
|
[derrivative0, derrivative1, derrivative2] = calculateDerrivatives(polynomial, zero);
|
|
[zPlus, zMinus] = calculateZ(degree, derrivative0, derrivative1, derrivative2);
|
|
newZero = chooseNewZero(zPlus, zMinus, zero);
|
|
[zero, iterations] = updateZeros(newZero, iterations, polynomial);
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\newpage
|
|
\subsubsection{calculateDerrivatives}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [derrivative0, derrivative1, derrivative2] = calculateDerrivatives(polynomial, zero)
|
|
derrivative0 = polynomial(zero);
|
|
derrivative1 = derivative(polynomial, zero, 1);
|
|
derrivative2 = derivative(polynomial, zero, 2);
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\subsubsection{calculateZ}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [zPlus, zMinus] = calculateZ(degree, derrivative0, derrivative1, derrivative2)
|
|
expressionUnderSquareRoot = (degree - 1) * ((degree - 1) * derrivative1 ^ 2 - degree * derrivative0 * derrivative2);
|
|
lagsqrt = sqrt(expressionUnderSquareRoot);
|
|
|
|
zPlus = degree * derrivative0 / (derrivative1 + lagsqrt);
|
|
zMinus = degree * derrivative0 / (derrivative1 - lagsqrt);
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\subsubsection{chooseNewZero}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function newZero = chooseNewZero(zPlus, zMinus, zero)
|
|
if abs(zPlus) < abs(zMinus)
|
|
newZero = zero - zPlus;
|
|
else
|
|
newZero = zero - zMinus;
|
|
end
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\newpage
|
|
\subsubsection{updateZeros}
|
|
\begin{simplechar}
|
|
\begin{lstlisting}
|
|
function [zero, iterations] = updateZeros(newZero, iterations, polynomial)
|
|
zero = newZero;
|
|
iterations(:, size(iterations, 2) + 1) = [zero, polynomial(zero)];
|
|
end
|
|
\end{lstlisting}
|
|
\end{simplechar}
|
|
|
|
\input{sections/11-task-3/01-rootbrackering-m}
|
|
\input{sections/11-task-3/02-printgraph-m}
|
|
\input{sections/11-task-3/03-printcomplexgraph-m}
|