Eigenmode expansionEigenmode expansion (EME) is a computational electrodynamics modelling technique. It is also referred to as the mode matching technique or the bidirectional eigenmode propagation method (BEP method). Eigenmode expansion is a linear frequency-domain method. It offers very strong benefits compared with FDTD, FEM and the beam propagation method for the modelling of optical waveguides, and it is a popular tool for the modelling linear effects in fiber optics and silicon photonics devices.
SiliceneSilicene is a two-dimensional allotrope of silicon, with a hexagonal honeycomb structure similar to that of graphene. Contrary to graphene, silicene is not flat, but has a periodically buckled topology; the coupling between layers in silicene is much stronger than in multilayered graphene; and the oxidized form of silicene, 2D silica, has a very different chemical structure from graphene oxide. Although theorists had speculated about the existence and possible properties of free-standing silicene, researchers first observed silicon structures that were suggestive of silicene in 2010.
Divide-and-conquer algorithmIn computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. The divide-and-conquer technique is the basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.
Genetic algorithmIn computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, causal inference, etc.
Multiplication algorithmA multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Efficient multiplication algorithms have existed since the advent of the decimal system. If a positional numeral system is used, a natural way of multiplying numbers is taught in schools as long multiplication, sometimes called grade-school multiplication, sometimes called the Standard Algorithm: multiply the multiplicand by each digit of the multiplier and then add up all the properly shifted results.
