Mathématiques

This document introduces the concept of weighted graphs, defining them as graphs with assigned weights to either edges (undirected case) or arcs (directed case). It discusses methods to calculate path weights, the shortest path, and distances between nodes. It distinguishes between undirected and directed cases, providing examples of weight calculations and shortest path analysis. Finally, the representation of weighted graphs is covered, including adjacency matrices and adjacency lists with weights.

This document consists of a comprehensive series of exercises focused on Boolean algebra and logic circuits. Key tasks include simplifying logical expressions using Boolean algebra, Karnaugh maps, and NAND gates. Additional exercises involve constructing truth tables, transforming expressions into canonical forms, and designing circuit diagrams. The document emphasizes the efficient implementation of logical functions with a minimal number of gates.

This document explores the resolution of linear systems (Sθ_α) defined by the matrix A, vector X, and result vector b, emphasizing specific cases for θ = 1 and θ as a real value. The methodologies employed include unique solution criteria using determinant calculations, LU decomposition for matrix factorization, and iterative resolution using both Jacobi and Gauss-Seidel methods. Key findings include conditions for the convergence of iterative methods when θ and α meet diagonal dominance criteria, as well as detailed step-by-step computation for iterations with initial guesses. Numerical re...

This document analyzes the invertibility and numerical resolution of a linear equation system (Sα) defined by a matrix A dependent on a parameter α. The conditions for matrix invertibility are derived through determinant evaluation, showing it is non-invertible for α = 0 and ±√2. The criteria for convergence for the Jacobi iterative method are established, requiring strict diagonal dominance, with α limited to ]-∞, -2[∪]2, +∞[. For α = 3, (S3) is solved using Gaussian elimination, documenting the iterative Jacobi method steps, including the first two iterations with initial vector X(0). Ite...

The document explores solving a linear system (S) represented as AX = b where matrix A is invertible. It demonstrates the system's unique solution via determinant analysis and confirms the LU decomposition feasibility using the principal minor test. The Jacobi iterative method's convergence is proven based on A's strict diagonal dominance. Solutions are computed using Gaussian elimination, and initial iterations of the Jacobi method are executed to illustrate the iterative convergence.

The document presents an in-depth exploration of Lagrange polynomial interpolation, emphasizing its unique construction methodology and mathematical foundation based on a set of n+1 distinct points. The Lagrange polynomials serve as a basis for vector spaces of polynomials, enabling precise interpolation and approximation of functions like f(x). Exercises highlight practical use, such as determining interpolated values and constructing interpolation polynomials. Finally, the Lagrange approach's numerical inefficiency when adding points is noted, with a preview of potential alternatives like...

This document discusses the Newton interpolation polynomial method used in numerical analysis. The method guarantees a unique polynomial that interpolates a given set of distinct points. The polynomial is constructed using a recursive structure involving divided differences for coefficient determination. Important aspects such as divided differences of varying orders and their recursive formulations are also elaborated, along with an example application to construct a second-degree polynomial. Finally, the document touches on the advantages of the Newton polynomial's incremental computation...

This document is a set of problem-solving tasks focusing on optimization challenges in industrial contexts, such as production scheduling, transportation cost minimization, resource allocation, inventory management, and profit maximization. Each exercise provides specific data and constraints, requiring the application of Excel-based computational tools to determine the optimal solutions. The methodologies rely on mathematical modeling, including linear programming and resource allocation techniques, to meet economic and operational goals efficiently.

This document is a series of exercises focused on linear programming, duality, and sensitivity analysis. The exercises guide students through deriving dual formulations of primal problems, solving the dual using the simplex method, and interpreting results for the primal problem. Particular attention is given to analyzing variations in coefficients (C'1, b'1, b'2) and determining the intervals within which the optimal solution base remains unchanged. Additional problems are based on past exam questions to reinforce core concepts in operational research.

This document provides a comprehensive exercise set focused on polynomial interpolation and polynomial approximation concepts in numerical analysis. The first section covers practical computations of interpolating polynomials, error analysis, and applications in least-squares approximation. The second section delves deeper into approaches involving Newton's polynomial basis with derivations for interpolated points and error metrics. Real-world scenarios, such as vehicle braking distance prediction, are used to contextualize theoretical methods. The exercises emphasize precision and interdis...

This document introduces key concepts of digital logic, focusing mainly on Boolean Algebra and its operators: AND, OR, and NOT. It explains the binary nature of digital systems, distinguishes between combinational and sequential circuits, and provides detailed tables and rules for logical operations such as truth tables and Boolean theorems. Representation methods, such as truth tables, canonical forms, and the Karnaugh map method for logical simplification, are extensively explored alongside real-world circuit implementations like logical gates.

Ce document démontre que certaines formules logiques sont des théorèmes en utilisant la méthode du raisonnement par l'absurde. Deux théorèmes sont prouvés comme étant des tautologies via la construction d'arbres de Beth, montrant que toutes les branches de ces arbres sont closes, conduisant à des contradictions. Les résultats montrent des implications logiques fondamentales dans la structure de la logique formelle.