Articles

Hosting Websites

EN

A website on your computer is not automatically reachable by other people. Hosting makes its files or application available over a network; DNS helps browsers find the hostname's destination; HTTPS protects communication between client and server. These are different concerns, and publishing a page ...

Testing

EN

A frontend is not finished when its first demonstration works. It must still work after a CSS change, a pricing-rule update, a dependency upgrade, or a failed network request. Testing turns the promises a feature makes to its users into checks that can fail when those promises are broken. It reduces...

Css Frameworks

EN

CSS preprocessors and frameworks are two important tools in a web developer's toolbox that can help streamline the process of building websites. CSS preprocessors allow developers to use new functionality that is typically borrowed from another programming language, while frameworks provide pre-writ...

Ui

EN

UI is an important aspect of frontend development, as it deals with the elements that users directly interact with. When designing the UI, it’s important to think about how color choices, overall layout, responsiveness, and interactive elements come together to make the product look appealing and ea...

Javascript Frameworks

EN

A static portfolio, a content website with minimal interactivity, and a client-heavy dashboard have different requirements. Begin with an explicit feature inventory: navigation/routing, persistence, data fetching, authentication boundaries, search requirements, accessibility, localization, bundle co...

Javascript

EN

JavaScript is a programming language that is primarily used for client-side scripting (making web pages interactive). Since NodeJS we can also use JavaScript in server-side scripting (e.g. for APIs)...

Css

EN

CSS work began in 1994; CSS1 became a recommendation in 1996 (W3C history). As pages became application interfaces, developers stretched document-layout tools into column systems. A float-based layout with percentage widths and clearfix rules made sense before dedicated layout systems were available...

Html

EN

HTML began as a way to describe linked scientific documents. That origin explains why headings, paragraphs, links, and forms remain useful foundations even for an application. The HTML Standard's history traces the later expansion into application features. Today HTML is a Living Standard: “HTML5” i...

Pathfinding Architecture

EN

Pathfinding in Standard of Iron is deliberately simple at the core: the game keeps one flat 2D navigation grid, and A* searches that grid. The grid is not a physics simulation, not a unit occupancy map, and not a navmesh. It is a compact answer to one question...

Partial Differential Equations

EN

A partial differential equation (PDE) relates an unknown function of several independent variables to its partial derivatives. PDEs describe fields rather than single trajectories: temperature in space and time, pressure in a fluid, displacement in an elastic body, or the amplitude of a wave...

Ordinary Differential Equations

EN

An ordinary differential equation (ODE) relates an unknown function of one independent variable to one or more of its derivatives. ODEs are the natural language of dynamical systems: they describe how a state changes when its instantaneous rate of change is known...

Heuns Method

EN

Heun's method improves Euler's method by using information from both ends of each step. It is a second-order explicit Runge–Kutta method and is also known as the explicit trapezoidal method or improved Euler method...

Picards Method

EN

Picard iteration turns an initial value problem into a sequence of integral approximations. Each iterate is a function obtained by substituting the previous function into the ODE's integral form. This construction is central to the Picard–Lindelof existence-and-uniqueness theorem and explains how fi...

Runge Kutta

EN

Runge–Kutta methods advance an ODE solution using several carefully chosen slope evaluations inside each step. They achieve higher-order accuracy without requiring derivatives of f; only evaluations of f itself are needed...

Eulers Method

EN

Euler's method is the simplest explicit time-stepping method for an initial value problem (IVP). It is useful both as a practical first approximation and as a way to understand how numerical ODE solvers work...

Monte Carlo

EN

Monte Carlo integration approximates an integral by averaging function values at randomly selected points and applying the appropriate volume or probability weights. The sampling distribution is part of the method: uniform samples use the domain volume, while nonuniform samples require weights that ...

Simpsons Rule

EN

Simpson's rule approximates a definite integral by integrating quadratic interpolants through sampled function values. On each panel it uses two endpoints and their midpoint, fitting a parabola through the three points. A composite rule repeats this construction across pairs of equal subintervals an...

Midpoint Rule

EN

The midpoint rule approximates a definite integral by dividing its interval into smaller pieces and representing each piece by a rectangle. The rectangle's width is the subinterval width, and its height is the function value at that subinterval's midpoint. Adding the signed rectangle areas estimates...

Integration Introduction

EN

Integration accumulates a quantity over an interval. It can recover total change from a known rate of change, measure area, and express solutions of differential equations. For example, integrating velocity over time gives displacement, including the sign of the motion...

Trapezoidal Rule

EN

The trapezoidal rule approximates a definite integral by connecting neighboring samples with straight line segments and integrating those segments. When the sampled values are nonnegative, each contribution is the area of a trapezoid; negative values contribute signed area in the same way as the exa...

Eigenvalues and Eigenvectors

EN

An eigenvector identifies a direction that a square matrix preserves under multiplication, while its eigenvalue records the scaling along that direction. The scaling may include a sign change or, over the complex numbers, a phase change. These concepts connect matrix transformations to vibration mod...

Matrix Methods

EN

Matrices organize numbers into rows and columns and represent linear transformations, systems of equations, and collections of data. Their dimensions determine which operations are defined, while their structure determines which numerical methods are appropriate. In applied mathematics and engineeri...

Singular Value Decomposition

EN

Singular value decomposition (SVD) expresses a matrix as orthogonal or unitary coordinate changes surrounding a rectangular diagonal scaling. It exists for every real or complex matrix, including rectangular and rank-deficient matrices, whereas a diagonal eigenvalue decomposition requires a diagonal...

Qr Method

EN

The QR method computes the eigenvalues of a square matrix through a sequence of similarity transformations. Each iteration factors the current matrix into an orthogonal factor Q and an upper-triangular factor R, then forms the product in the opposite order. The new matrix has the same eigenvalues bu...

Power Method

EN

The power method estimates an eigenvalue of largest magnitude and its associated eigendirection by repeatedly multiplying a vector by a matrix and normalizing the result. Each multiplication strengthens the contribution from a strictly dominant eigenvalue relative to smaller ones. For the eigenbasis...

Eigen Value Decomposition

EN

Eigenvalue decomposition, also called eigendecomposition, expresses a diagonalizable square matrix in a basis of its eigenvectors. In that basis, the transformation acts independently along each eigenvector by multiplying it by the corresponding eigenvalue. Changing back to the original coordinates ...

Inverse Matrix

EN

The inverse of a square matrix A is denoted by A⁻¹. When it exists, it is the unique matrix whose product with A, on either side, is the identity matrix I. Mathematically, this is expressed as...

Systems of Equations

EN

A linear system of equations is a collection of one or more linear equations involving the same set of variables. Such systems arise in diverse areas such as engineering, economics, physics, and computer science. The main goal is to find values of the variables that simultaneously satisfy all equati...

Lu Decomposition

EN

LU decomposition, or LU factorization, stores Gaussian elimination as a product of triangular matrices. In the unpivoted form, A = LU, where L is lower triangular and U is upper triangular; with row pivoting, the convention used here is PA = LU. The factors support linear-system solves, determinant ...

Jacobi Method

EN

Jacobi iteration approximates the solution of a linear system A x = b by repeatedly updating every component from the previous iterate. Each row is solved for the variable on its diagonal, with all other components held at their old values during that sweep. The resulting vector becomes the input to...

Gauss Seidel

EN

Gauss–Seidel is an iterative method for a linear system A x = b, with A ∈ ℝ^(n×n), unknown vector x = (x₁,…,xₙ)ᵀ, and given right-hand side b. It updates one component at a time during a sweep through the equations. Each new component is used immediately in the remaining updates, while components no...

Gaussian Elimination

EN

Gaussian elimination solves a linear system by applying elementary row operations to its augmented matrix. Each operation preserves the solution set while eliminating a coefficient below a pivot. The process produces an upper-triangular system, which can be solved from the last equation upward by ba...

Secant Method

EN

The secant method approximates a root of f(x) = 0 using the two most recent points on the graph. Instead of evaluating the derivative in Newton's formula, it uses the slope of the secant line through those points. The next approximation is the zero of that line. This makes the method useful when an ...

Relaxation Method

EN

The relaxation method, commonly referred to as the fixed-point iteration method, is an iterative approach used to find solutions (roots) to nonlinear equations of the form f(x) = 0. Instead of directly solving for the root, the method involves rewriting the original equation in the form...

Newtons Method

EN

Newton's method, also called the Newton–Raphson method, approximates a root using the function value and its first derivative at the current point. It replaces the nearby curve by its tangent line and uses that line's zero as the next approximation. This is an open method: one starting guess is suff...