Complexity of Short and Coarse-Grained Time Series (dyncomp)
While there are many well-established measures for identifying critical fluctuations and phase transitions, these measures only work with many points of measurement and thus are unreliable when studying short and coarse-grained time series. This package provides a measure for complexity in a time series that does not rely on long time series (Kaiser (2017), <doi:10.17605/OSF.IO/GWTKX>).

Algorithms for Finding Fixed Point Vectors of Functions (FixedPoint)
For functions that take and return vectors (or scalars), this package provides 8 algorithms for finding fixed point vectors (vectors for which the inputs and outputs to the function are the same vector). These algorithms include Anderson (1965) acceleration <doi:10.1145/321296.321305>, epsilon extrapolation methods (Wynn 1962 <doi:10.2307/2004051>) and minimal polynomial methods (Cabay and Jackson 1976 <doi:10.1137/0713060>).

Sparse Estimation of Large Time Series Models (bigtime)
Estimation of large Vector AutoRegressive (VAR), Vector AutoRegressive with Exogenous Variables X (VARX) and Vector AutoRegressive Moving Average (VARMA) Models with Structured Lasso Penalties, see Nicholson, Bien and Matteson (2017) <arXiv:1412.5250v2> and Wilms, Basu, Bien and Matteson (2017) <arXiv:1707.09208>.

Topic Modelling (BullsEyeR)
Helps in initial processing like converting text to lower case, removing punctuation, numbers, stop words, stemming, sparsity control and term frequency inverse document frequency processing. Helps in recognizing domain or corpus specific stop words. Makes use of ‘ldatunig’ output to pick optimal number of topics for topic modelling. Helps in extracting dominant words or key words that represent the context/topics of the content in each document.

Matrix Completion, Imputation, and Inpainting Methods (filling)
Filling in the missing entries of a partially observed data is one of fundamental problems in various disciplines of mathematical science. For many cases, data at our interests have canonical form of matrix in that the problem is posed upon a matrix with missing values to fill in the entries under preset assumptions and models. We provide a collection of methods from multiple disciplines under Matrix Completion, Imputation, and Inpainting. See Davenport and Romberg (2016) <doi:10.1109/JSTSP.2016.2539100> for an overview of the topic.

Non-Invasive Pretty Printing of R Code (styler)
Pretty-prints R code without changing the user’s formatting intent.